c语言的冒泡排序简单实例

冒泡排序的时间复杂度为 O(n^2);

/*************************** *冒泡排序算法 *data:2017.8.17 *Author:shi * *************************/#include //交换函数void exchange(int *num_1,int *num_2){*num_1 += *num_2;*num_2 = *num_1 - *num_2;*num_1 = *num_1 - *num_2;}int main(void){int arry[10] = {11,66,88,55,44,99,22,65,89,1};int i,j;int size = sizeof(arry)/sizeof(arry[0]);//遍历printf("later:");for(i = 0;i < size;i++)printf(" %d ",arry[i]);printf("\n");//进行比较for(i = 0;i < size; i++){for(j = i+1;j < size;j++){if(arry[i] > arry[j])exchange(&arry[i],&arry[j]);}}//遍历printf("after:");for(i = 0;i < size;i++)printf(" %d ",arry[i]);printf("\n");return 0;}