How about , using a sorting algorithm like Quick sort and return diff of last and the before last element.
Best Regards Abhijit On Sun, Feb 6, 2011 at 3:29 PM, Decipher <ankurseth...@gmail.com> 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) & Space is not a constraint [upto O(3N)] > > > -- > 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.
