Hi, please help me solve this problem. It's something like that: given an array A[1...n] filled with different integers in range [1...n], find a missing number. The only operation which you can use is get_ith_bit_from_pos_n(i, n) = i'th bit of A[n]. This can be solved in O(n) time. But how?
--~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups-beta.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
