Termpaper written for Algorithms and Data Structures Course

Here, we benchmark the runtimes of 2 inbuilt sort algorithms, and 3 other sort algorithms written in python.
We attempt to prove that all of their runtimes are of the order of theta- n*log(n).
The proof would look more solid if we had collected at least 5 more data points of increasing list sizes. However, as we were running on our own personal PCs, the largest numerical list we have consists of 10.48 million floating point numbers.

Name		Name	Last commit message	Last commit date
Latest commit History 34 Commits
.ipynb_checkpoints		.ipynb_checkpoints
CSV_and_pickle		CSV_and_pickle
Latex		Latex
Latex_1125		Latex_1125
Output-pickle-and-Csv		Output-pickle-and-Csv
Plots_and_data - Copy		Plots_and_data - Copy
Putting_extra_files_here		Putting_extra_files_here
TermPaperTemplate		TermPaperTemplate
Time_it_and_algorithms		Time_it_and_algorithms
final_paper		final_paper
final_paper101		final_paper101
initial_sketch		initial_sketch
plots_and_data		plots_and_data
Benchmarking_sorting_algorithms_in_Python-Group17.pdf		Benchmarking_sorting_algorithms_in_Python-Group17.pdf
Benchmarking_sorting_algorithms_in_Python_Group17_after_diff.pdf		Benchmarking_sorting_algorithms_in_Python_Group17_after_diff.pdf
README.md		README.md

Provide feedback