I have the Problem given:
"n,k,l are positive integers. You have an array A with n=2^l-k elements. The elements of the array are pairwise different binary strings. So k binary strings are missing in the array. The only way you can access A is by calling the function FetchBit(i, j), which returns the jth bit of the string A[i].
Suppose n= 2^l-k, i.e. exactly k of the bit strings do not appear in A. Describe an algorithm to find the k missing bit strings in A using only O(nlog(k)) calls to FetchBit."
I could solve a it with k=1 in O(n) by counting the times 1 and 0 are in the first position and then continue with the strings who start with the the less occurring number.(so n +n/2 +n/4+... steps) But for k I could not get my head around this Problem.