选择排序C++

#include<iostream>
using namespace std;
void swap1(int *arr, int a, int b) {//交换数组元素
	int tem = arr[a];
	arr[a] = arr[b];
	arr[b] = tem;
}
void selectionSort(int *a,int length) {
	
	int index = 0;
	int mark = 0;
	for (int i=0;i<length;i++)
	{
		int min = i;
		for (int j = i+1; j < length; j++) {
			if (a[j]<a[min] ) {
				swap1(a,min,j );
			}
		}
	}
}
int main() {
	int arr[10] = { 10,2,4,3,1,5,16,10,18,1 };
	int len = sizeof(arr) / sizeof(arr[0]);//数组的长度
	cout << "排序前的数组为：" << endl;
	for (int i = 0; i < 10; i++) {
		cout << arr[i] << endl;
	}
	selectionSort(arr, len);
	cout << "排序后的数组为：" << endl;
	for (int i = 0; i < 10; i++) {
		cout << arr[i] << endl;
	}
	system("PAUSE");


}