Binary search #57

drewlarsson480 22.05.2026 12:01

Extracted from a larger project

algo.py

def fib(n):
    if n <= 1: return n
    return fib(n-1) + fib(n-2)

print(fib(10))

utils.py

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

print(factorial(5))

test.py

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

print(factorial(5))