Co-Authored-By: Claude Sonnet 5.5 <[email protected]> Claude-Session: https://claude.ai/code/session_017ic4b3tGdV3Vm51QUZxg2x
12 lines
740 B
Plaintext
12 lines
740 B
Plaintext
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
|