# O(n) — Linear Search: up to 1,000,000 comparisons
def linear_search(arr, target):
    for i in range(len(arr)):
        if arr[i] == target:
            return i
    return -1

# O(log n) — Binary Search: up to 20 comparisons
def binary_search(arr, target):
    left, right = 0, len(arr) - 1
    while left <= right:
        mid = (left + right) // 2
        if arr[mid] == target:
            return mid
        elif arr[mid] < target:
            left = mid + 1
        else:
            right = mid - 1
    return -1

Big-O Notation — Time & Space Complexity

Big-O Notation — Time & Space Complexity

Big-O Notation — Time & Space Complexity