do you need an algorithm which is O(1) in space? if not it's trivial. Anil
On Tue, Jul 6, 2010 at 7:29 PM, sharad kumar <[email protected]>wrote: > Given an array of n numbers in which all the members are less than or equal > to k (k<n). device an algorithm of order O(k) to find the first repeating > element > > -- > 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]<algogeeks%[email protected]> > . > 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 [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.
