Heap sort #15

nicorossi866 22.05.2026 11:16

Heap sort #15

Clean and minimal

data.py

def factorial(n):
    if n == 0: return 1
    return n * factorial(n-1)

print(factorial(5))

app.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))

views.py

def debounce(fn, delay):
    import time
    last = [0.0]
    def wrapper(*args):
        now = time.time()
        if now - last[0] >= delay:
            last[0] = now
            return fn(*args)
    return wrapper

Heap sort #15

Are you sure you want to delete this post?