will this method solve the prob in O(n) ????????
Balasubramaniam Mariappan wrote: > i think we can solve this similar to finding the loop in linked list with > two pointers.... hare and tortoise method .. > > On 8/16/06, shashi_genius <[EMAIL PROTECTED]> wrote: > > > > > > There are n numbers with all (n-1) unique numbers, except for one which > > is repeating. > > Find out the repeating number in O(n) complexity. > > > > > > > > > > > > -- > with regards, > Balasubramaniam > > A person who is original might be wrong, but a person who does not risk > being wrong can never be right..... > > Osho > > ------=_Part_254324_6321734.1155737911697 > Content-Type: text/html; charset=ISO-8859-1 > > i think we can solve this similar to finding the loop in linked list with two > pointers.... hare and tortoise method .. <br><br><div><span > class="gmail_quote">On 8/16/06, <b class="gmail_sendername">shashi_genius</b> > <<a href="mailto:[EMAIL PROTECTED]"> > [EMAIL PROTECTED]</a>> wrote:</span><blockquote class="gmail_quote" > style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; > padding-left: 1ex;"><br>There are n numbers with all (n-1) unique numbers, > except for one which > <br>is repeating.<br>Find out the repeating number in O(n) > complexity.<br><br><br><br><br></blockquote></div><br><br clear="all"><br>-- > <br>with regards,<br>Balasubramaniam<br><br>A person who is original might be > wrong, but a person who does not risk being wrong can never be right..... > <br><br>Osho > > ------=_Part_254324_6321734.1155737911697-- --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
