Note: The interview book has related exercises, but the ideas are relatively unclear and the layout is incorrect. The author has rewritten the related books and opinions for your reference.
11. Data Structure interview 12-sorting 3 (Summary of Sorting Algorithm classification, sorting time, spatial complexity, and stability)
Sorting Algorithm Classification
Insert sorting class |
Select sorting class |
Exchange sorting class |
Merge Sorting class |
Insert sort directly |
Hill sorting |
Select sort directly |
Heap sorting |
Bubble Sorting |
Quick sorting |
Merge Sorting |
Sorting Algorithm summary:
|
Average time complexity |
Best case |
Worst case |
Space complexity |
Stability |
Insert sort directly |
O (n2) |
O (N) |
O (n2) |
O (1) |
Stability |
Bubble Sorting |
O (n2) |
O (N) |
O (n2) |
O (1) |
Stability |
Select sort directly |
O (n2) |
O (n2) |
O (n2) |
O (1) |
Unstable |
Hill sorting |
O (nlogn )~ O (n2) |
O (n1.3) |
O (n2) |
O (1) |
Unstable |
Quick sorting |
O (nlogn) |
O (nlogn) |
O (n2) |
O (logn) |
Unstable |
Heap sorting |
O (nlogn) |
O (nlogn) |
O (nlogn) |
O (1) |
Unstable |
Merge Sorting |
O (nlogn) |
O (nlogn) |
O (nlogn) |
O (N) |
Stability |