冒泡排序C++

#include<iostream>
using namespace std;
void swap(int *arr, int a, int b) {//交换数组元素
	int tem = arr[a];
	arr[a] = arr[b];
	arr[b] = tem; 
	
}
void bubbleSort(int * a,int length ) {
	int low = 0;
	int high = length - 1;
	while (low < high) {
		for (int i = 0;i<high;i++) {
			if (a[i]>a[i+1]) {
				swap(a, i, i + 1);
			}
		}
		high = high - 1;
	}
}
/*int main() {
	int arr[10] = {0,2,20,3,41,5,16,107,18,1009};
	int len=sizeof(arr) / sizeof(arr[0]);//数组的长度
	cout << "排序前的数组为：" << endl;
	for (int i = 0; i < 10; i++) {
		cout << arr[i] << endl;
	}
	bubbleSort(arr,len);
	cout << "排序后的数组为：" << endl;
	for (int i = 0; i < len; i++) {
		cout << arr[i]  << endl;
	}
	system("PAUSE");
}
*/