I think Min heap will do that.. On Mon, Oct 10, 2011 at 12:37 AM, Ankur Garg <[email protected]> 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 [email protected]. > To unsubscribe from this group, send email to > [email protected]. > 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 [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
