C++ 冒泡排序

---

#include <iostream>
using namespace std;
void bob_sort(int array[],int length){
	int k;
	for (int i = 0  ; i < length -1 ; i ++){
		for (int j = 0; j < length -1 -i ; j++){
			if (array[j] > array[j+1]){	
				k = array[j];
				array[j] = array[j+1];
				array[j+1] = k;
			}
		}
	}
}
int main() {
	int array[] = {99,1,3,4,8,12,24,66,43,31};
	bob_sort(array,sizeof(array)/sizeof(int));	
	for (int i = 0 ; i < sizeof(array)/sizeof(int) -1 ; i++){
		cout<<array[i]<<endl;
	}
	return 0;
}