Given a sorted list of integers arr and a target integer target, return the index of target in the list.
If the target is not in the list, return -1.
Do not use Python's built-in `index()` or `in` operator — implement the binary search algorithm yourself.
Binary search is O(log n) — searching a million records takes at most 20 comparisons. It powers database indexes, dictionary lookups, and version control diffing.