4. Given an integer n, an unsorted array A is to contain all integers in [0,...

 

Transcribed Image Text:

4. Given an integer n, an unsorted array A is to contain all integers in [0, 1] but one. Every integer is represented by its binary code. How will you efficiently identify the missing integer? The only allowed read operation is to read a particular bit of a particular integer. You do not have access to the entire integer. What is the time complexity of your method? (20) 4. Given an integer n, an unsorted array A is to contain all integers in [0, 1] but one. Every integer is represented by its binary code. How will you efficiently identify the missing integer? The only allowed read operation is to read a particular bit of a particular integer. You do not have access to the entire integer. What is the time complexity of your method? (20)