冒泡排序

不想多说，直接上代码。

*1.外循环,pass，总送len-1 轮
*2.内循环，每次将最大的数放在最后
*/


void bubble_sort(int* A, int len){
	int temp = 0;
	for(int pass = 1; pass < len; pass ++){
		for(int i=0; i < len - pass; i++){
			if(A[i] > A[i+1]){ //交换A[i]和A[i+1]
				temp = A[i];
				A[i] = A[i+1];
				A[i+1] = temp;
			}
		}
	}
}

int main(){
	int A[10] = {2,1,5,0,3,8,6,4,7,9};
	bubble_sort(A, 10);
	for(int i=0; i < 10; i++){
		cout<<A[i]<<"  ";
	}
	cout<<endl;
}