You can read the task, take hints and check your answer — but nothing is saved. No XP, no skill points, and this task will not be marked complete.
Write `bsearch(arr, target)` returning the index of `target` in a sorted list, or `-1` if absent.
What this proves: Implement a bounded search with a correct termination condition.
Need assistance? You can reveal sequential hints. Each hint applies a minor penalty to your score.
If you are completely stuck, you can unlock the full step-by-step walkthrough.