Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Possible Duplicate:
question about missing element in array
decrease runtime to O(n)
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 .how to do it?? Can we do it in O(n) time?
Yes you can do it in O(n). But if it’s your homework, you should try yourself.