Below is the syntax highlighted version of Questions.java
from §4.2 Sorting and Searching.

/****************************************************************************** * Compilation: javac Questions.java * Execution: java Questions k * Dependencies StdIn.java * * This code uses binary search to play the game of twenty questions. * It takes an integer command-line argument k, asks you to think of a * number between 0 and n-1, where n = 2^k, and always guesses the answer * with n questions. * * % java Questions 7 * Think of an integer between 0 and 127 * Is it less than 64? false * Is it less than 96? true * Is it less than 80? true * Is it less than 72? false * Is it less than 76? false * Is it less than 78? true * Is it less than 77? false * Your number is 77 * ******************************************************************************/ public class Questions { // invariant: answer is in [lo, hi) public static int search(int lo, int hi) { if ((hi - lo) == 1) return lo; int mid = lo + (hi - lo) / 2; StdOut.printf("Is it less than %d? ", mid); if (StdIn.readBoolean()) return search(lo, mid); else return search(mid, hi); } public static void main(String[] args) { int k = Integer.parseInt(args[0]); int n = (int) Math.pow(2, k); StdOut.printf("Think of an integer between %d and %d\n", 0, n-1); int secret = search(0, n); StdOut.printf("Your number is %d\n", secret); } }

Last updated: Fri Oct 20 14:12:12 EDT 2017.