山本夏木

摘要： #includeint Partition(int A[], int low, int high){ int pivot; pivot = A[low]; while(low = pivot)// 1.相等不替换 2.不要遗漏low < high的判断 high--; A[low] = A[high]; whil... 阅读全文