摘要:
void adjust(int i, int nLen) { int j = ((nLen - 1) - 1) / 2; while (j >= i) { if (2 * j + 1 > nLen - 1) { break; } if (2 * j + 2 > nLen - 1) ... 阅读全文
摘要:
void QuickSort(int nLow, int nHigh) { int s = nLow; int e = nHigh; int nPivot = nLow; if (s >= e) { return; } while (1) { while (g_szArray[nLow] g_s... 阅读全文