冒泡排序

/*
*冒泡排序 
*/ 

#include<stdio.h>
#include<stdlib.h>

void bubbleSort(int *arr,int len){
	int *p;
	int n; 
	int temp; 
	
	for(n = 0;n < len;n++){
		p = arr; 
	
		while(p < arr + len - n - 1){
		
			if(*p > *(p + 1)){
				//互换
				temp = *p;
				*p = *(p +1); 
				*(p + 1) = temp;
				 
			}
			p = p + 1;
		}

	}

}

int main(void){
	
	int arr[10] = {95,56,46,72,22,3,5,658,306,6};
	int i;
	
	printf("排序前：\n");
	for(i = 0;i < 10;i++){
		printf("%d	",arr[i]);
	}
	printf("\n");
	
	bubbleSort(arr,10);	
	
	printf("排序后：\n"); 
	for(i = 0;i < 10;i++){
		printf("%d	",arr[i]);
	}
	printf("\n");
	
	system("pause");
	return 0;
}