Process

- Pick a pivot point. Random will do.
- Seperate the group into two groups, in which one is 'larger' than the pivot point and one is 'smaller' than the pivot point.
- Send each of these groups to a new copy of the algorithm. These will repeat steps 1 through 3 with their respective groups.
- After all items are isolated, they will return to the original algorithm sorted.

- Faster than Mergesort

- Requires more cpu

Image taken from: NCZ Online

Image taken from: Wikipedia

Process:

- Divide the group into 2 even groups.
- Send both of these new groups to new copies of algorithm.
- Each of these algorithms will repeat steps 1 and 2 until each item has been isolated.
- As the items return, the algorithms will sort their group before sending to the previous 'parent' algorithm.

Requires less cpu

Takes longer than Quicksort