@Shuaib: It will work in all cases. If you don't think so, give a counterexample.
Dave On Aug 16, 12:50 am, Shuaib <[email protected]> wrote: > That will work but not in all cases as radix sort isn't a generalized sorting > algorithm, is it? :) > > -- > Shuaibhttp://twitter.com/ShuaibKhanhttp://www.bytehood.com/ > > On 16-Aug-2011, at 10:10 AM, Dave <[email protected]> wrote: > > > > > @Shuaib: You could sort the numbers in O(n) with a radix sort, and > > then finding the min is easy. Mind you, the radix sort might be slower > > than an O(n log n) sort, but still it satisfies the O(n) constraint. > > > Dave > > > On Aug 15, 8:41 pm, Shuaib <[email protected]> wrote: > >> That won't work. And I don't think an O(n) solution is possible. > > >> -- > >> Shuaibhttp://twitter.com/ShuaibKhanhttp://www.bytehood.com/ > > >> On 16-Aug-2011, at 6:25 AM, sukran dhawan <[email protected]> wrote: > > >>> find the minimum of two numbers in a loop o(n) and subtract the two > > >>> On Tue, Aug 16, 2011 at 6:13 AM, Brijesh Upadhyay > >>> <[email protected]> wrote: > >>> Algorithm to find the two numbers whose difference is minimum among the > >>> set of numbers. For example the sequence is 5, 13, 7, 0, 10, 20, 1, 15, > >>> 4, 19 The algorithm should return min diff = 20-19 = 1. Constraint - Time > >>> Complexity O(N) > > >>> -- > >>> You received this message because you are subscribed to the Google Groups > >>> "Algorithm Geeks" group. > >>> To view this discussion on the web > >>> visithttps://groups.google.com/d/msg/algogeeks/-/U8gTWUISJn8J. > >>> 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 > >>> athttp://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 > >>> athttp://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 > > athttp://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.
