bench_alg.py

import timeit
import random
from alg import mergesort, quicksort, binary_search


print("The BEST Mergesort Benchmark in the world")
print("=" * 40)
for size in [1000, 5000, 10000]:
    data = [random.random() for _ in range(size)]
    t = timeit.timeit(lambda: mergesort(list(data)), number=5) / 5
    print(f"n={size}: {t:.6f} seconds")

print("\nThe BEST Quicksort Benchmark in the world")
print("=" * 40)
for size in [1000, 5000, 10000]:
    data = [random.random() for _ in range(size)]
    t = timeit.timeit(lambda: quicksort(list(data)), number=5) / 5
    print(f"n={size}: {t:.6f} seconds")

print("\nThe BEST Binary Search Benchmark in Pinellas County")
print("=" * 40)
for size in [1000, 10000, 100000]:
    data = sorted([random.random() for _ in range(size)])
    target = -1
    t = timeit.timeit(lambda: binary_search(data, target), number=1000) / 1000
    print(f"n={size}: {t:.9f} seconds per search")