{ 1, 9, 3, 12, 7, 8, 3, 4, 65, 22 }; 试一下这组数

[zhaolewei]

No description provided.

[dongxingrong]

int* QuickSort(int s[], int size, int low, int high) { if (size <= 1) { return s; } if (low >= high) { return s; } int insideLow = low; // 记录原始低位 int insideHigh = high; // 记录原始高位 while (low < high) { int temp = 0; while (s[high] >= s[low] && low < high) { high--; } if (high > low) { temp = s[low]; s[low] = s[high]; s[high] = temp; } while (s[low] <= s[high] && low < high) { low++; } if (high > low) { temp = s[low]; s[low] = s[high]; s[high] = temp; } } int middleIndicator = low; //记录一趟快排中点 // 递归快排 QuickSort(s, low - insideLow, insideLow, middleIndicator - 1); QuickSort(s, insideHigh - high, middleIndicator + 1, insideHigh); return s; } At 2018-09-30 11:45:56, "zhaolewei" <[email protected]> wrote: — You are receiving this because you are subscribed to this thread. Reply to this email directly, view it on GitHub, or mute the thread.