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
最差時間複雜度 (Worst case performance):O(n^2)
最佳時間複雜度 (Best case performance):O(n)
平均時間複雜度 (Average case performance):O(n^2)
最差空間複雜度 (Worst case space complexity): O(1) auxiliary