Merge sort #41

parkerpetrov527 22.05.2026 11:16

Merge sort #41

Feedback appreciated

core.py

def binary_search(arr, target):
    lo, hi = 0, len(arr) - 1
    while lo <= hi:
        mid = (lo + hi) // 2
        if arr[mid] == target: return mid
        elif arr[mid] < target: lo = mid + 1
        else: hi = mid - 1
    return -1

print(binary_search([1,3,5,7,9], 7))

Merge sort #41

Are you sure you want to delete this post?