onyx_online/grokking-algorithms
1
0
Fork 0
mirror of https://github.com/onyx-and-iris/grokking-algorithms.git synced 2024-09-27 11:07:03 +01:00
Code Issues Packages Projects Releases Wiki Activity
ab09aa5269
grokking-algorithms/chapter4
History
onyx-and-iris 1d22356ce5 upd readmes, rename exercises.
2024-02-06 22:04:37 +00:00
..
ex4.1.py upd readmes, rename exercises. 2024-02-06 22:04:37 +00:00
ex4.3.py upd readmes, rename exercises. 2024-02-06 22:04:37 +00:00
ex4.4.py upd readmes, rename exercises. 2024-02-06 22:04:37 +00:00
quicksort.py cleanup quicksort 2024-01-08 15:46:21 +00:00
README.md upd readmes, rename exercises. 2024-02-06 22:04:37 +00:00

README.md

Quicksort

Similar to the previous recursive function, quicksort uses divide and conquer.

The base case occurs for an array size 0 or 1 (doesn't need to be sorted).

The recursive case works by partitioning the array around a chosen pivot repeatedly until the base case is met and then combining all sorted sub-arrays.

Note. Quicksort should be implemented using a random pivot to ensure average runtimes.