Learn fast sorting again (C language), learn sort C Language

Learn fast sorting again (C language), learn sort C Language

# Include <stdio. h> void QuickSort1 (int * s, int left, int right) {int I, j, t, weight; if (left> right) return; if (left <right) {iterator = s [left]; // reference I = left; j = right; while (I! = J) {while (I <j & s [j]> = equals) j --; // from the right to the left, find the first number smaller than the base number while (I <j & s [I] <= strong) I ++; // from left to right find the first number larger than the baseline number if (I <j) // exchange two numbers {t = s [I]; s [I] = s [j]; s [j] = t;} s [left] = s [I]; // Reference Data normalization s [I] = percentile; QuickSort1 (s, left, I-1); QuickSort1 (s, I + 1, right );}} void QuickSort2 (int * s, int left, int right) {int I, j, struct; if (left> right) return; if (left <right) {iterator = s [left]; // reference I = left; j = right; while (I! = J) {while (I <j & s [j]> = equals) j --; // find the first number that is smaller than the reference number from the right to the left. if (I <j) {s [I] = s [j]; I ++ ;} while (I <j & s [I] <= strong) I ++; // from left to right find the first number larger than the base number if (I <j) {s [j] = s [I]; j --;} s [I] = percentile; // Reference Data normalization QuickSort2 (s, left, I-1 ); quickSort2 (s, I + 1, right) ;}int main () {int a [] = }; // QuickSort1 (a,); QuickSort1 (a,); int I = 0; for (; I <10; I ++) printf ("% d ", a [I]); return 0 ;}