算法导论排序算法之选择排序（二）

#include <iostream>using namespace std;void select_sort(int *arr, int n){int tmp;for (int i = 0; i < n-1; i++){tmp = i;for (int j = i+1; j < n; j++){if (arr[j] < arr[tmp]){tmp = j;}}if (tmp != i){int tmp2;tmp2 = arr[tmp];arr[tmp] = arr[i];arr[i] = tmp2;}}return ;}void print(int* arr, int n){for (int i = 0; i < n; i++){cout << arr[i];}return;}int main(void){int arr[10] = {2,4,3,1,6,8,9,7,5,0};select_sort(arr, 10);print(arr, 10);return 0;}