Proofs of Algorithm Correctness and Runtime Estimates · Guessing a Number
Lesson 8
Programming problem. Implement a strategy that asks at most twelve questions and guesses \(0 \le x < 16\) assuming that at most one of the answers is wrong.
Proofs of Algorithm Correctness and Runtime Estimates · Guessing a Number
Programming problem. Implement a strategy that asks at most twelve questions and guesses \(0 \le x < 16\) assuming that at most one of the answers is wrong.