Worst case performance :О(n2) comparisons, swaps
Best case performance :O(n) comparisons, O(1) swaps
Average case performance: О(n2) comparisons, swaps
Worst case space complexity: О(n) total, O(1) auxiliary
參考資料:
66
43
76
28
51
58
62
68
73
15
17
83
4
42
21
60
35
95
88
27
100