we take the difference with the maximum element found so far. So we
need to keep track of 2 things:
1) Minimum difference found so far (min_diff).
2) Maximum number visited so far (max_element).
min_diff=abs(a[0]-a[1]);
max_elem=a[0]
for(i=1;i<arr_size;i++)
if(abs(max_elem-a[i])<min_diff)
min_diff = abs(max_elem-a[i]);
if(a[i]>max_elem)
max_elem=a[i];
Ankuj
On Aug 16, 7:26 pm, Shuaib Khan <aries.shu...@gmail.com> wrote:
> Dave, I agree. :)
>
>
>
>
>
>
>
>
>
> On Tue, Aug 16, 2011 at 6:33 PM, Dave <dave_and_da...@juno.com> wrote:
> > @Shuaib: We are talking about an array of numbers, arent't we? It is
> > natural to assume that the numbers fall into one of the defined data
> > types.
>
> > Dave
>
> > On Aug 16, 4:23 am, Shuaib <aries.shu...@gmail.com> wrote:
> > > Yes it will work in this specific case. What I meant was that Radix sort
> > isn't always applicable in general to achieve linear time sorting. Its
> > complexity isn't exactly O(N) rather O(d*N) where d is the number of bytes
> > each of our item consumes. So if the elements in array aren't from a finite
> > range, that would be an issue.
>
> > > Correct me if I am wrong.
>
> > > --
> > > Shuaibhttp://twitter.com/ShuaibKhanhttp://www.bytehood.com/
>
> > > On 16-Aug-2011, at 11:05 AM, Dave <dave_and_da...@juno.com> wrote:
>
> > > > @Shuaib: It will work in all cases. If you don't think so, give a
> > > > counterexample.
>
> > > > Dave
>
> > > > On Aug 16, 12:50 am, Shuaib <aries.shu...@gmail.com> 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 <dave_and_da...@juno.com> 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 <aries.shu...@gmail.com> 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 <sukrandha...@gmail.com>
> > 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 <
> > brijeshupadhyay...@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)
>
> > > >>>>> --
> > > >>>>> 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 algogeeks@googlegroups.com.
> > > >>>>> To unsubscribe from this group, send email to
> > algogeeks+unsubscr...@googlegroups.com.
> > > >>>>> 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 algogeeks@googlegroups.com.
> > > >>>>> To unsubscribe from this group, send email to
> > algogeeks+unsubscr...@googlegroups.com.
> > > >>>>> 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 algogeeks@googlegroups.com.
> > > >>> To unsubscribe from this group, send email to
> > algogeeks+unsubscr...@googlegroups.com.
> > > >>> 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 algogeeks@googlegroups.com.
> > > > To unsubscribe from this group, send email to
> > algogeeks+unsubscr...@googlegroups.com.
> > > > 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 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.
>
> --
> Shuaibhttp://www.bytehood.comhttp://twitter.com/ShuaibKhan
--
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.
