摘要： static int Split(int[] arr, int first, int last) { int splitPos = first; int pivot = arr[first]; int lastExchangePos = first; bool getLastExchange = false; for (int i = last; i >= first + 1; --i ) { if (arr[i] < pivot && arr[i - 1] > pivot) { getLastExchange = true; lastExchangeP... 阅读全文