DATA260P Project 1: Sorting Algorithm Analysis

Connor McManigal and Peyton Politewicz

Implemented MergeSort, QuickSort, InsertionSort, ShellSort, BucketSort, and RadixSort
Created BinaryInsertionSort in an effort to improve InsertionSort runtimes and Simple Tim Sort to improve MergeSort runtimes
Compared time complexity of each on truly random generated arrays and almost sorted generated arrays at sizes 1000, 2000, 4000, 8000, and 16000
Evaluated and compared empirical and theoretical big-O as datasets scaled in size
Diagnosed runtime ratios, plotted findings, and drew conclusions on our algorithmic performance

Name		Name	Last commit message	Last commit date
Latest commit History 51 Commits
__pycache__		__pycache__
figure		figure
.gitignore		.gitignore
README.md		README.md
almost_sorted_results.csv		almost_sorted_results.csv
analysis_stats_plots.ipynb		analysis_stats_plots.ipynb
as_table.csv		as_table.csv
final_report.ipynb		final_report.ipynb
final_report.pdf		final_report.pdf
implementation.py		implementation.py
project1_tests.py		project1_tests.py
tr_table.csv		tr_table.csv
uniform_results.csv		uniform_results.csv