描述
- T ( n ) = O ( n 2 ) T(n)=O(n^2) T(n)=O(n2)
- S ( n ) = O ( 1 ) S(n)=O(1) S(n)=O(1)
- 不稳定的排序
Code
void simpleSelectSort(int r[], int n)
{
int i, j, k;
int temp;
for (i = 0; i < n - 1; ++i) {
k = i;
for (j = i + 1; j < n; ++j) {
if (r[k] > r[j])k = j;
}
if (i != k) {
temp = r[k];
r[k] = r[i];
r[i] = temp;
}
}
}