Change the implementation of quicksort to use Median-of-Three partitioning,
as described in the textbook. That is, to choose the pivot, pick the median
of the first, middle, and last elements of the current range.
-
Couldn't load subscription status.
- Fork 0
IUDataStructuresCourse/quicksort-pre-lecture
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Pre-lecture assignment about quicksort
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published