C++实现选择排序

void selectsort(int arr[], int n);
void print(int arr[], int n);
void selectsort(int arr[],int n) {
	int i = 0;
	if (arr == NULL || n < 2) {
		return ;
	 }
	for (i = 0; i < n; i++) {
		int j = 0;
		int minindex = i;
		for (j = i + 1; j < n; j++) {
			minindex = arr[minindex] > arr[j] ? j : minindex;
		}
		swap(arr, i, minindex);
	}
}
void swap(int arr[], int i, int j) {
	int tmp = 0;
	tmp = arr[i];
	arr[i] = arr[j];
	arr[j] = tmp;
}
void print(int arr[], int n) {
	int i = 0;
	for (i = 0; i < n; i++) {
		cout << arr[i] << endl;
	}
}
int main() {
	int arr[9] = { 5,6,3,8,9,4,1,6,5 };
	selectsort(arr, 9);
	print(arr, 9);
	system("pause");
	return 0;
}