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,9 @@
Recursive vs iterative: same answers, and how deep the recursion goes
=====================================================================
n=1000, elements 0,2,4,...,1998: 2003 keys from -1 to 2001 (present and absent)
give identical answers from the iterative and the recursive version.
n= 10 absent key above the last element: result=-1, recursion frames=5 (iterative uses 0 extra frames)
n= 1,000 absent key above the last element: result=-1, recursion frames=11 (iterative uses 0 extra frames)
n=1,000,000 absent key above the last element: result=-1, recursion frames=21 (iterative uses 0 extra frames)