Binary search

Also written: binary_search

Repeatedly halving a sorted list to find a value or the first position that works, in O(log n). Rust's `binary_search` returns `Ok(index)` or `Err(index)` for where it would go.