You are given an array A of n distinct integers , expressed in binary. Each integer is in the range [0,n] .As there are n+1 values in this range, there is exactly one number missing .As a single operation, you may access the jth integer(A[i][j]) . Note that it would take O(nlogn) time to read the full array.
Give an O(n) algorithm to determine which integer is missing , and justify its correctness, You may assume that n = 2^k - 1 for some integer k. -- 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.
