Write binary search as a function. The checker tries it on sorted lists of different lengths, with targets that are there and not there, and counts your steps.
Have you tried it?
Do the tasks in the editor first, and run the checker after each one. Its hints help when a check fails. When you are ready, compare your code with this solution.
Log in to join the discussion.
Loading…