7.选择排序

#include "pch.h"
#include <iostream>
void selectionSort(int arr[], int n) {
    int min = 0;
    for (int i = 0; i < n-1; i++) {             //总共由n-1趟
        min = i;
        for (int j = i+1; j < n; j++) {   //每趟比较n-i次  找到最小的值与已排序序列末元素（首元素++)交换
            if (arr[min] > arr[j])
                min = j;
        }
        std::swap(arr[min], arr[i]);
    }
}
int main() {
    int a[8] = { 4,2,3,7,6,9,8,5 };
    selectionSort(a,8);
    for (int k = 0; k < 8; k++) {
        std::cout << a[k] << " ";
    }
}