Re: Searching missing number in large data.
- From: Wayne Smith <wts@xxxxxxxxx>
- To: Oracle Freelist <oracle-l@xxxxxxxxxxxxx>
- Date: Wed, 19 May 2010 10:18:58 -0400
If there is no positional information in your n numbers and the number of
missing numbers is small compared to n, I don't see an O(log(n)) solution.
But then I don't even see an O(n) solution as presented!
Cheers, Wayne
On Wed, May 19, 2010 at 8:50 AM, Abhishek Gurung <
abhishek.gurung@xxxxxxxxxxx> wrote:
> Hi everyone,
>
> Thanks for looking into this problem.
> I Want to clarify few things.
>
> 1. The numbers are not ordered they are random.
> 2. We have to just find only one of the missing number not all.
> 3. The complexity should be of O(logn) [Big O notation].
>
> Note: I don't know whether the solution exist or not I am looking for it
> all over the net but couldn't got the answer.
>
>
> ------------------------------
> The latest auto launches and test drives Drag n'
> drop<http://autos.in.msn.com/>
>
Other related posts:
