冒泡排序

#ifndef BUBBLING_INSERT_H[
#define BUBBLING_INSERT_H
void bubblingInsert(int *arr,int Length); 
void bubblingInsert(int *arr,int Length){
	int temp; 
	for(int i=0;i<Length ;i++){
		for(int j=0;j<Length-1-i; j++){
			if(arr[j]>arr[j+1]){
				temp=arr[j]; 
				arr[j]=arr[j+1]; 
				arr[j+1]=temp; 
			}
		}
	}
}
#endif 

来自为知笔记(Wiz)