for numbers from 0 to n, if you count the numbers whose LSB is 0 vs. those has 1, if count(0) > count(1), the missing number's LSB is 1, otherwise it's 0. Continue for the second LSB, your can find the missing number bitwise.
On Mar 1, 3:14 pm, bittu <[email protected]> wrote: > An array A[1...n] contains all the integers from 0 to n except for one > number which is missing. In this problem, we cannot access an entire > integer in A with a single operation. > The elements of A are represented in binary, and the only operation we > can use to access them is “fetch the jth bit of A[i]”, which takes > constant time. Write code to find the missing integer. Can you do it > in O(n) time? > > Thanks & Regards > Shashank Mani -- 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.
