选择排序 - c++实现

#include
#include
using namespace std;

void insertionSort(vector &arr){
    for(int i = 1; i < arr.size(); ++i){
        int tmp = arr[i];
        int j = i - 1;
        while(j >= 0 && arr[j] > tmp){
            arr[j + 1] = arr[j];
            j--;
        }
        arr[j + 1] = tmp;
    }
}

int main(){
    vector arr{10, 9, 7, 8, 6, 5, 2, 4, 3, 1};
    insertionSort(arr);
    for(auto each : arr)
        cout << each << " ";
    cout << endl;
    return 0;
}