Consider the 4 numbers 31, 33, 35, 37. Assume I think of a…
Consider the 4 numbers 31, 33, 35, 37. Assume I think of a particular permutation (say 37, 33, 31, 35), and that you must find that permutation by asking questions that are answered by “yes” or “no”. To solve that task, what is the smallest number of questions that will always suffice?
Read Details