题解 | #C++选择排序#

#include <iostream>
using namespace std;

int main() {

    int arr[6] = { 0 };
    int len = sizeof(arr) / sizeof(int);
    
    for (int i = 0; i < len; i++) {
        cin >> arr[i];
    }
    int temp;
    // write your code here......
    for (int i = 0; i < len - 1; i++)
    {
        for (int j = i +1; j < len; j++)
        {
            if (arr[i] > arr[j])
            {
                temp = arr[i];
                arr[i] = arr[j];
                arr[j] = temp;
            }
        }       
    }
    for (int i = 0; i < len; i++) {
        cout << arr[i] << " ";
    }
    return 0;
}

选择排序，和冒泡排序相邻比较不同，把最小的依次放在前面