This was a project for CS 323. The purpose of this project was to analyze the runtimes of Merge Sort, Quick Sort and Insertion sort in nanoseconds instead of just giving the big O runtime. This program will give you the average runtime of each of the 3 sorting algorithms when ran 100 times.
-
Notifications
You must be signed in to change notification settings - Fork 0
LinditaKalaj/323-Project-3
About
CS 323 sorting analysis project 3
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published