-冒泡排序

void sort(int *arr,int sz) {

	for (int x = 0; x < sz;x++) {
		for (int i = 0; i < sz-1; i++) {
			int a = arr[i];
			int b = arr[i + 1];
			int tmp = 0;
			if (a < b) {
				tmp = a;
				a = b;
				b = tmp;
			}
		}
	}

}


int main() {
	
	int arr[8] ={ 1,2,3,4,5,6,7,8 };
	int sz = sizeof(arr)/sizeof(arr[0]);
	sort(arr,sz);
	for (int i = 0; i < sz;i++) {
		cout << arr[i] << endl;
	}
	return 0;
}