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:
@@ -0,0 +1,19 @@
|
||||
InteractiveDemo (the original console program) with scripted input; values echoed like a terminal
|
||||
=================================================================================================
|
||||
|
||||
Enter how many numbers to be stored: 5
|
||||
Enter 5 numbers in INCREASING ORDER:
|
||||
Element [1]: 10
|
||||
Element [2]: 20
|
||||
Element [3]: 30
|
||||
Element [4]: 40
|
||||
Element [5]: 45
|
||||
Enter the number to search: 40
|
||||
Number 40 found at position 4
|
||||
Want to search another number? (y/n): y
|
||||
Enter the number to search: 10
|
||||
Number 10 found at position 1
|
||||
Want to search another number? (y/n): y
|
||||
Enter the number to search: 25
|
||||
Number NOT found in the array.
|
||||
Want to search another number? (y/n): n
|
||||
Reference in New Issue
Block a user