冒泡排序

#include <stdio.h>void sort_arr( int *pArr,int length){int i,j,t;for(i=0;i<length;++i){for(j=i+1;j<length;++j){if(pArr[i]>pArr[j]){t=pArr[i];pArr[i]=pArr[j];pArr[j]=t;}}}}void sort(int a[],int len)//指针法实现{int i=0;int *p;int temp=0;for(;i<len;i++)for(p=a;p<a+len-1;p++){if(*p > *(p+1)){temp = *p;*p = *(p+1);*(p+1) = temp;}}}void print_arr(int a[],int length){for(int i=0;i<length;i++){printf("%d ",a[i]);}printf("\n");}int main(void){int a[]={5,4,3,8,0,36};sort_arr(a,6);print_arr(a,6);return 0;}