排序算法--选择排序C++实现

#include<iostream>using namespace std;void chooseSort(int *list, int n) {for(int i = 0; i < n-1; i++) {int k = i;     //k用来记录最小元素的编号for(int j = i +1; j < n; j++) {if(list[j] < list[k]) {k = j;}}int temp = list[i];list[i] = list[k];list[k] = temp;}}int main() {int list[10] = {2,4,3,7,6,8,5,9,0,1};chooseSort(list, 10);for(int i = 0; i < 10; i++) {cout <<list[i] <<" ";}return 0;}