On Oct 10, 10:48 am, Shravan <shravann1...@gmail.com> wrote: > http://ideone.com/D5W2y >
Good :). What if array is unsorted. What will be the best solution in terms of time complexity? Better then (nlog(n)+n). Regards Rohit -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
