冒泡排序

之前写了个选择排序，那就再来个冒泡吧

int tmp[]={1,2,3,4,5,6,7,8,9,0}; void selectionSort(int *arr,int len) { //printf("%d",sizeof(a)); int i=0,j=0,max=0,t=0; for(i=0;i<len-1;i++) { max=i; for (j=i+1;j<len;j++) { if (arr[i]<arr[j]) { max=j; } } if (max!=i) { t=arr[max]; arr[max]=arr[i]; arr[i]=t; } } } void bubbleSort(int * arr,int len) { int i=0,j=0,t=0; for (i=0;i<len-1;i++) { for (j=0;j<len-1-i;j++) { if (arr[j]>arr[j+1]) { t=arr[j]; arr[j]=arr[j+1]; arr[j+1]=t; } } } } int _tmain(int argc, _TCHAR* argv[]) { printf("%d,%d/n",sizeof(tmp),sizeof(int)); int i=0,j=0,max=0,t=0,count; count=sizeof(tmp)/sizeof(int); printf("count:%d/n",count); selectionSort(tmp,count); printf("/n"); for (i=0;i<sizeof(tmp)/sizeof(int);i++) { printf("%d,",tmp[i]); } printf("/n"); bubbleSort(tmp,count); for (i=0;i<sizeof(tmp)/sizeof(int);i++) { printf("%d,",tmp[i]); } return 0; }