@Amol: Since you don't restrict using extra space, use hashing or do a radix sort, either being O(n*k+b).
Dave On Feb 15, 12:07 pm, Amol Sharma <amolsharm...@gmail.com> wrote: > Given an array of size n*k+b.In this array n elements are repeated k times > and 1 elements are repeated b times.find the Elements which is repeated b > time.( O(n*k+b) expected ) > -- > > Amol Sharma > Third Year Student > Computer Science and Engineering > MNNIT Allahabad > <http://gplus.to/amolsharma99> > <http://twitter.com/amolsharma99><http://in.linkedin.com/pub/amol-sharma/21/79b/507><http://www.simplyamol.blogspot.com/> -- 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.
