Big-o-calculator

Added "limit" parameter on test function to break before it takes forever to sort one array (eg. bubble Sort, Insertion Sort)

* default is True

Better docs

Example with more familiar sorting algorithm (quickSort with random pivot)

Generating ksorted array fixes

No warning even if it has no return (It'll check if the function sorted arrays correctly so please return the output)

it will return complexity and the execution time to sort all [10, 100, 1_000, 10_000, 100_000]

print the execution time

capital letters to lower cases (log(N) -> log(n))

added more test cases

test function now will return two variables (cplx, error, result -> cplx, result)

Added pytest cases

Added Ksorted array option

Don't assert even tho it has no return