"""
 sorting_template.py

 A starting template for a python program sorting algorithm.

 Jim Mahoney | cs.bennington.college | Feb 16 2022 | MIT License
"""
from random import randint
from time import time

def random_array(n, smallest=1, largest=10000):
    """ return a list of of n integers """
    result = [0] * n
    for i in range(n):
        result[i] = randint(smallest, largest)
    return result

def my_sort(numbers):
    """ return a smallest-to-largest array sorted list of nubers """
    # TODO : Implement your own sorting algorithm here.
    #        (Do not use python's builtin sorted() or list.sort().)
    return None               # A placeholder - not the right answer.

def main():
    print("=== sorting ===")
    print(f"  {'n':>6}    {'sec':>9} ")
    print(f"  {'-'*6:6}    {'-'*9:9} ")
    for n in [100, 300, 1000, 3000, 10000]:
        values = random_array(n)
        start_time = time()
        sorted_values = my_sort(values)
        # sorted_values = sorted(values)   # testing 
        stop_time = time()
        assert sorted_values == sorted(values)  # Did it work?
        print(f"  {n:6}    {stop_time - start_time: 9.6f} ")

main()