普通快排可能会超时，如： int quickSort(int* a, int left, int right) { int key = a[left]; while (left < right) { while (left < right && key < a[right]) { right--; } a[left] = a[right]; while (left < right && key > a[left]) { left++; } a[right] = a[left]; } a[left] = key; return left; }