It won't work for following case If suppose array contains the following integers 10 5 1 15 9 then according to you answer would be diff = |1-5| = 4 but correct answer is diff = |9-10| = 1
Thanks and Regards Amit Chauhan http://web.iiit.ac.in/~chauhan Mobile : +91-9966347645 Y! IM : [email protected] GTalk : [email protected] ........................................................................................................ There is always, always, always something to be thankful for !! ........................................................................................................ Sent from Hyderabad, AP, India Ogden Nash <http://www.brainyquote.com/quotes/authors/o/ogden_nash.html> - "The trouble with a kitten is that when it grows up, it's always a cat." On Wed, Sep 2, 2009 at 2:57 PM, Varun S V <[email protected]> wrote: > Since we difference between two minumum elements should suffice, how about > finding the min and second minimum element in the array in single scan and > returning their difference. This should take not more than O(N) time. > > Regards, > -Varun. > > > On Wed, Sep 2, 2009 at 12:09 AM, Shishir Mittal <[email protected]>wrote: > >> Sort the array and find the minimum of difference of adjacent values of >> the sorted array. >> Time Complexity : O(nlogn), Space Complexity : O(1) >> >> On Tue, Sep 1, 2009 at 6:35 PM, ankur aggarwal >> <[email protected]>wrote: >> >>> given a array of length n. find 2 number such that their differnce is >>> minimum..... >>> >>> >>> >>> >>> >> >> >> -- >> Shishir Mittal >> Ph: +91 9936 180 121 >> >> >> >> > > > > --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
