This is a school project I did for Design and Analysis of Algorthims. It compares the Run times of Insertion Sort, Merge-Sort, and Quicksort with different input sizes. It then graphs the results using a Python script.
-
Notifications
You must be signed in to change notification settings - Fork 0
mddrill/Sorting-Algorithms
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A school project that compares the complexity of three different sorting algorithms. Written in Java and Python.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published