This was a quite large assignment at Royal Institute of Technology. We implemented Quick Sort with and without Insertion Sort in Java.
-
Notifications
You must be signed in to change notification settings - Fork 0
QuickSort implementation that switches to Insertion Sort when the sub-array gets small enough. At KTH we wrote a report where we investigated how different aspects such as pivotal points, using Insertion Sort or not, type of input data affect the time it takes to sort an array.
KTH-Ivan-Liljeqvist/Quick-Sort-in-Java
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
QuickSort implementation that switches to Insertion Sort when the sub-array gets small enough. At KTH we wrote a report where we investigated how different aspects such as pivotal points, using Insertion Sort or not, type of input data affect the time it takes to sort an array.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published