Add binary-search module: iterative/recursive search, overflow-safe midpoint, lowerBound/upperBound, rotated arrays, search on the answer, 10 interview problems (14 tests, 14 transcripts)

Co-Authored-By: Claude Sonnet 5.5 <[email protected]>
Claude-Session: https://claude.ai/code/session_017ic4b3tGdV3Vm51QUZxg2x
This commit is contained in:
Claude
2026-11-22 19:47:36 +05:30
parent 3336e2ba15
commit ce12a80f58
39 changed files with 2110 additions and 0 deletions
@@ -0,0 +1,11 @@
Elements looked at: linear scan vs binary search (counted, not timed)
=====================================================================
n | linear scan, absent key | binary, worst over every key | floor(log2 n) + 1
10 | 10 | 4 | 4
1,000 | 1,000 | 10 | 10
100,000 | 100,000 | 17 | 17
1,000,000 | 1,000,000 | 20 | 20
n=1,000,000,000 (memory-free Sequence): the most probes seen over 10,002 sampled keys = 30; floor(log2 n) + 1 = 30
a linear scan of the same data would look at up to 1,000,000,000 elements