@Shiva: How can min heap be uesd, can you eloborate a bit. As far as i see, the best possible is O(nlogn) i.e by sorting and scanning over the complete array once.
On Mon, Oct 10, 2011 at 9:49 AM, shiva@Algo <shiv.jays...@gmail.com> wrote: > I think Min heap will do that.. > > > On Mon, Oct 10, 2011 at 12:37 AM, Ankur Garg <ankurga...@gmail.com> wrote: > >> Given an unsorted array of Integers >> >> Find 2 nos whose diff is minimum >> >> Say Array is 4 2 18 19 11 8 5 >> >> Nos are 18 and 19 >> >> Algo shud be of O(n) >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to algogeeks@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. >> > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@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. > -- Thanks&Regards: -sandeep -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@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.
