If sorting can never pay for a single binary search, when does sorting first win, and how bad can a sort that just shuffles get?
Short drills on what this video just taught. Write the code, run the checks, and reveal the answer only if you are stuck.
Bisection search keeps halving the part of the list still in play. Starting from n elements, halve with integer division (//) until only one element is left, and count the halvings. Define halvings(n) returning that count.