mirror of
https://github.com/onyx-and-iris/grokking-algorithms.git
synced 2024-09-27 11:07:03 +01:00
8 lines
154 B
Python
8 lines
154 B
Python
import math
|
|
|
|
num_steps = int(math.log2(128*2))
|
|
print(
|
|
f"A binary search would take maximum {num_steps} steps "
|
|
"to search a list of 256 items."
|
|
)
|