how to sort data?
| Name |
Best Case Time Complexity |
Average Case Time Complexity |
Worst Case Time Complexity |
Space Complexity |
| Bubble Sort |
O(n) |
O(n²) |
O(n²) |
O(1) |
| Insertion Sort |
O(n) |
O(n²) |
O(n²) |
O(1) |
| Merge Sort |
O(nlogn) |
O(nlogn) |
O(nlogn) |
O(n) |
| Quick Sort |
O(nlogn) |
O(nlogn) |
O(n²) |
O(logn) |
- Size of array
- How sorted it already is
- How much extra memory is at our disposal
- Whether the program can be parallelised
