冒泡排序 void bubbleSort(int r[], int n) { int i, j, temp; bool flag = true; for (i = 0; i < n-1&&flag; ++i) { flag = false; for (j = 0; j < n-i-1; ++j) { if (r[j] > r[j + 1]) { flag = true; temp = r[j]; r[j] = r[j + 1]; r[j + 1] = temp; } } } } T ( n ) = O ( n 2 ) T(n)=O(n^2) T(n)=O(n2)