-
Quick sort is a divide and conquer algorithm.
-
It picks an element as pivot and partitions the given array around the picked pivot.
| Algorithm | Best Case | Average Case | Worst Case | Space Complexity |
|---|---|---|---|---|
| Bubble Sort | O(n) | O(n^2) | O(n^2) | O(1) |
| Selection | O(n^2) | O(n^2) | O(n^2) | O(1) |
| Insertion | O(n) | O(n^2) | O(n^2) | O(1) |
| Recursion | O(n log n) | O(n log n) | O(n^2) | O(n) |
| Merge | O(n log n) | O(n log n) | O(n log n) | O(n) |
| Quick | O(n log n) | O(n log n) | O(n^2) | O(log n) |