The goodness of binary search
24th March 2003
Tim Bray provides an in depth, practical explanation of the binary search algorithm with example code in Java. Great revision material for second year computer scientists like myself.
More recent articles
- Initial impressions of Claude Fable 5 - 9th June 2026
- Running Python code in a sandbox with MicroPython and WASM - 6th June 2026
- Claude Opus 4.8: "a modest but tangible improvement" - 28th May 2026