one simple brute force method I see is that sort the array with the best possible time complexity and then take the difference between the two middle most if n is even or compare the difference between the adjacent and middle element and take the lower is n is odd.
On Tue, Sep 1, 2009 at 6:35 PM, ankur aggarwal <ankur.mast....@gmail.com>wrote: > given a array of length n. find 2 number such that their differnce is > minimum..... > > > > > > -- Regards Bhanu Pratap Singh Software Engineer A R I C E N T Mobile +91 9886738496 Main +91 080 41068106 --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
