The efficiency is low, the time complexity should be O (n*n) bar.
Although bubbling is a relatively simple sort, it is helpful to write it again or to help you to understand and remember deeply.
/*============================================================================= # # FileName:BubbleSort.cpp # Desc: Bubble Sort # # # Author:yulu # email:187373778@qq.com # # created:2014-05-01 23:51:00 # Version: 0.0.1 # History: # 0.0.1 | Yulu | 2014-05-01 23:51:00 | Initialization # =============================================================================*/#include < stdio.h> #include <stdlib.h>//rand srand #include <time.h> #define SORT_NUM void bubble_sort (int *list , int len) {for (int. i=0;i<len;i++) {for (int j=len-1;j>=i+1;j--) {if (list[j]<list[j-1]) {int Te
MP=LIST[J];
LIST[J]=LIST[J-1];
List[j-1]=temp;
}}}} void Print_array (int *list,int len) {for (int i=0;i<len;i++) {printf ("%3d", List[i]);
if (i!=len-1) printf ("");
} printf ("\ n");
} int main (void) {int len = Sort_num;
int List[len];
Srand (Time (0)); for (int i = 0; I < leN
++i) {List[i] = rand ()% 100;
} print_array (list, len);
Bubble_sort (list, len);
Print_array (list, len);
return 0;
}