| algorithm | best time | avg time | worst time | space | stable | time cost |
|---|---|---|---|---|---|---|
| QuickSort | O(nlogn) | O(nlogn) | O(n^2) | O(1) | NO | 134ms |
| MergeSort | O(nlogn) | O(nlogn) | O(nlogn) | O(n) | YES | 211ms |
| HeapSort | O(nlogn) | O(nlogn) | O(nlogn) | O(1) | NO | 395ms |
| ShellSort | O(nlogn) | O(n^?) | O(n^2) | O(1) | NO | 307ms |
| CombSort | O(nlogn) | O(n^?) | O(n^2) | O(1) | NO | 249ms |
| InplaceMergeSort | O(nlogn) | O(nlogn) | O(nlogn) | O(1) | NO | 257ms |
| SmoothSort | O(n) | O(nlogn) | O(nlogn) | O(1) | NO | 569ms |
| LibrarySort | O(nlogn) | O(nlogn) | O(n^2) | O(n) | YES | 576ms |