MOOC清华《程序设计基础》第4章：选择排序（函数写法）

#include <iostream>using namespace std;int main(){int a[17]={56,32,67,12,23,89,3,14,2,25,43,31,1,24,44,35,76};void SelectionSort(int cards[], int n);  //指针作形参必须写出形参名void OutputOfArray(int cards[], int n);  //指针作形参必须写出形参名 OutputOfArray(a,10);SelectionSort(a,10);  //可以只排前10个数 OutputOfArray(a,10);  //可以只输出前10个数 return 0;}void SelectionSort(int cards[],int n){for(int i = 0; i < n; i++){int min = cards[i], min_id = i;for(int j = i + 1; j < n; j++)if(cards[j] < min){min = cards[j];min_id = j;}cards[min_id] = cards[i];cards[i] = min;}}void OutputOfArray(int cards[],int n){for(int i = 0; i < n; i++)cout << cards[i] << '\t';cout << endl;}