C language implementation of common sorting

C language implementation of common sorting

Void BubbleSort (int R [], int n) // bubble sort time complexity O (n2) {int I, j, temp, flag; for (I = n; i> = 2; I --) {flag = 0; for (j = 2; j <= I; j ++) {if (R [J-1]> R [j]) {temp = R [J-1]; R [J-1] = R [j]; R [j] = temp; flag = 1 ;}}if (flag = 0) {return ;}} void InsertSort (int R [], int n) // directly Insert the sorting time complexity O (n2) {int I, j, temp; for (I = 2; I <= n; I ++) {temp = R [I]; j = I-1; while (j> = 1 & R [j]> temp) {R [j + 1] = R [j]; j --;} R [j + 1] = temp;} void QuikSort (int R [], int l, int r) // fast schedule complexity O (nlogn) {int I, j, temp; I = l; j = r; if (l
 
  
I & R [j]> temp) -- j; // searches for the next value less than temp in reverse order and exchanges it with R [I] if (I