Quick Sort

This is a recursive algorithm used to solve the sorting problem that uses pivots to sort the list. A very brief guide to how this works is as follow

1. Choose a pivot .
2. Partition into , , and .
3. Recursively sort and .

The issue is how to choose a good piviot - ideally you would want to pick the median element.

Run time

This runs in time.