【筆記】Sorting 排序

for (int i=N-2; i>=0; i--){
    for (int j=0; j<=i; j++){
        if (a[j] > a[j+1]) swap(a[j], a[j+1]);
    }
}

for (int i=1; i<N; i++) {
    int key = a[i];
    int j = i - 1;
    while (key < a[j] && j >= 0) {
        a[j+1] = a[j];
        j--;
    }
    a[j+1] = key;
}

for (int i=0; i<N-1; i++) {
    int mn = a[i];
    int pos = i;
    for (int j=i+1; j<N; j++){
        if (a[j] < mn){
            mn = a[j];
            pos = j;
        }
    }
    swap(a[i], a[pos]);
}