/*
2.选择排序
最佳情况：T(n) = O(n2)
最差情况：T(n) = O(n2)
平均情况：T(n) = O(n2)
*/
void selectiveSort(int* arrays, int n) {
    int temp, m, k;
    for(int i = 0; i < n - 1; i++) {
        m = arrays[i];
        k = i;
        for(int j = i + 1; j < n; j++) {
            if(arrays[j] < m) {
                m = arrays[j];
                k = j;
            }
        }
        temp = arrays[i];
        arrays[i] = m;
        arrays[k] = temp;
    }
}