My implementation of a faster mergeSort and quickSort algorithm than those in the book we were reading for my Algorithms & Data Structures class. There is also an anaylsis of the runtime for the different sorting algorithms, as well as a notice that the default sorting algorithm for arrays is faster than them all becuase it uses a version of quicksort with more than one pivot.
-
Notifications
You must be signed in to change notification settings - Fork 0
NotRunningJ/Sorting-Algorithms
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Different sorting algorithms I implemented in my Algorithms & Data Structures class
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published