选择排序

原理图

#include <iostream>#include <algorithm>using namespace std;int main() {    int arr[6] = { 6,5,4,3,2,1 };    int  min, temp;    for (int i = 0; i < 6; i++)    {        min = i;        for (int j = i + 1; j < 6; j++)            if (arr[j] < arr[i])                min = j;        temp = arr[min];        arr[min] = arr[i];        arr[i] = temp;    }    for (int i = 0; i < 6; i++)        cout << arr[i] << " ";    cout << endl;    system("pause");    return 0;}