Minimum Tests to Find the Broken Revision
You have 100 sequential code revisions. At some point, a bug was introduced -- meaning revisions
$ through $k-1$ are clean, and revisions $k$ through
00$ are broken. You can test any revision to determine whether it is clean or broken.
What is the minimum number of tests needed to guarantee you find the exact revision $k$ that introduced the bug?
Open the full interactive solver, hints, and worked solution →