mirror of
https://github.com/onyx-and-iris/grokking-algorithms.git
synced 2024-11-15 17:30:52 +00:00
upd binary searches
This commit is contained in:
parent
d646cb83c1
commit
ea9af3f1c7
@ -6,13 +6,7 @@ logging.basicConfig(level=logging.DEBUG)
|
||||
logger = logging.getLogger(__name__)
|
||||
|
||||
|
||||
LOWER = 1000
|
||||
UPPER = 1000000
|
||||
SAMPLE_SIZE = 1000
|
||||
|
||||
|
||||
def binary_search(arr, item):
|
||||
count = 1
|
||||
low = 0
|
||||
high = len(arr) - 1
|
||||
|
||||
@ -20,27 +14,29 @@ def binary_search(arr, item):
|
||||
mid = (low + high) // 2
|
||||
guess = arr[mid]
|
||||
if guess == item:
|
||||
logger.debug(f"found item after {count} splits")
|
||||
return mid
|
||||
elif guess > item:
|
||||
high = mid - 1
|
||||
else:
|
||||
low = mid + 1
|
||||
|
||||
count += 1
|
||||
|
||||
return None
|
||||
|
||||
|
||||
LOWER = 1000
|
||||
UPPER = 1000000
|
||||
SAMPLE_SIZE = 1000
|
||||
|
||||
|
||||
numbers = random.sample(range(LOWER, UPPER), SAMPLE_SIZE)
|
||||
numbers.sort()
|
||||
logger.debug(numbers)
|
||||
|
||||
start = time.time()
|
||||
res = None
|
||||
while res is None:
|
||||
result = None
|
||||
while result is None:
|
||||
guess = random.randrange(LOWER, UPPER)
|
||||
res = binary_search(numbers, guess)
|
||||
logger.debug(f"guess: {guess}")
|
||||
result = binary_search(numbers, guess)
|
||||
|
||||
|
||||
print(f"Found {guess} at index {res}. Running time {time.time() - start}")
|
||||
print(f"Found {guess} at index {result}. Running time {time.time() - start}")
|
||||
|
43
chapter4/binary.py
Normal file
43
chapter4/binary.py
Normal file
@ -0,0 +1,43 @@
|
||||
import logging
|
||||
import random
|
||||
import time
|
||||
|
||||
logging.basicConfig(level=logging.DEBUG)
|
||||
logger = logging.getLogger(__name__)
|
||||
|
||||
|
||||
def binary_search(arr, low, high, x):
|
||||
# x not found, low has overlapped high so we return None
|
||||
if high < low:
|
||||
return
|
||||
|
||||
mid = (high + low) // 2
|
||||
|
||||
# x found at middle of split, return its index
|
||||
if arr[mid] == x:
|
||||
return mid
|
||||
|
||||
# x in left side of split
|
||||
elif arr[mid] > x:
|
||||
return binary_search(arr, low, mid - 1, x)
|
||||
|
||||
# x in right side of split
|
||||
else:
|
||||
return binary_search(arr, mid + 1, high, x)
|
||||
|
||||
|
||||
LOWER = 1000
|
||||
UPPER = 1000000
|
||||
SAMPLE_SIZE = 1000
|
||||
|
||||
numbers = random.sample(range(LOWER, UPPER), SAMPLE_SIZE)
|
||||
numbers.sort()
|
||||
|
||||
start = time.time()
|
||||
result = None
|
||||
while result is None:
|
||||
guess = random.randrange(LOWER, UPPER)
|
||||
logger.debug(f"guess: {guess}")
|
||||
result = binary_search(numbers, 0, len(numbers) - 1, guess)
|
||||
|
||||
print(f"Found {guess} at index {result}. Running time {time.time() - start}")
|
Loading…
Reference in New Issue
Block a user