SelectionSort，选择排序，C++实现

// g++ selection_sort.cc -Wall -O3 -std=c++11 && ./a.exe


#include <iostream>
#include <vector>


static void swap(int &a, int &b) {
    int temp = a;
    a = b;
    b = temp;
}

static size_t GetIndexOfMin(std::vector<int> &arr, size_t begin) {
    size_t indexOfMin = begin;
    for (size_t i = begin + 1; i < arr.size(); ++i) {
        if (arr[i] < arr[indexOfMin]) {
            indexOfMin = i;
        } // else nothing
    }

    return indexOfMin;
}

static void SelectionSort(std::vector<int> &arr) {
    for (size_t i = 0; i < arr.size(); ++i) {
        size_t indexOfMin = GetIndexOfMin(arr, i);
        if (i != indexOfMin) {
            (void)swap(arr[i], arr[indexOfMin]);
        } // else no need to swap
    }
}

int main(int argc, char const *argv[]) {
    std::vector<int> v {
        6, 8, 9, 8, 7, 6, 5, 2, 0, -1
    };

    (void)SelectionSort(v);
    for (int i: v) {
        std::cout << i << "\t";
    }
    std::cout << "\n";

    return 0;
}