Quick Sort

Quick Sort

1. Divide

   • Divide the problem into two smaller ones => partition the collection into 2 smaller sub-collections

2. Conquer

   • Conquer by solving the smaller ones => sort recursively each sub-collection

3. Combine

   • Combine the two sorted sub-partitions

4. Runs the fastest when median is chosen as pivot

5. O(N log^2 N)