can u do dis problem in linear time, o(n)?? On Wed, Oct 6, 2010 at 4:20 PM, Mukesh Gupta <mukeshgupta.2...@gmail.com>wrote:
> Keep inserting elements in a binary search tree and break once you get > the find the element in the tree. > Complexity=O(n log n) > > On 10/5/10, sourav <souravs...@gmail.com> wrote: > > You are given an array of positive numbers in which one number is > > repeated. Rest all are present only once. Find the duplicate number in > > linear or sub linear time. > > > > -- > > You received this message because you are subscribed to the Google Groups > > "Algorithm Geeks" group. > > To post to this group, send email to algoge...@googlegroups.com. > > To unsubscribe from this group, send email to > > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> > . > > For more options, visit this group at > > http://groups.google.com/group/algogeeks?hl=en. > > > > > > > -- > > > Mukesh Gupta > Delhi College of Engineering > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@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 algoge...@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.
