onyx_online/grokking-algorithms
1
0
Fork 0
mirror of https://github.com/onyx-and-iris/grokking-algorithms.git synced 2024-11-15 17:30:52 +00:00
Code Issues Packages Projects Releases Wiki Activity

add ex 1.1/1.2

Browse Source
This commit is contained in:
onyx-and-iris 2023-12-19 03:41:10 +00:00
parent f5603c824b
commit 49644bdbaf
2 changed files with 14 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
chapter1/ex1.1.py Normal file
View File

@ -0,0 +1,7 @@
import math
num_steps = int(math.log2(128))
print(
f"A binary search would take maximum {num_steps} steps "
"to search a list of 128 items."
)

7
chapter1/ex1.2.py Normal file
View File

@ -0,0 +1,7 @@
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."
)