我花了很多时间试图找出我没有的权利;调试和所有,但我似乎无法把我的手指,为什么我的快速排序错过了一些排序项目。快速排序除了几个项目之外
我已经将我的代码复制到下面的排序和分区。我有一种感觉,这是我看过的非常明显的东西,但我花了无数时间来调试,研究和重写我的代码,结果总是如此。
// quicksort the subarray from a[lo] to a[hi]
private void sort(Comparable[] a, int lo, int hi) {
if((hi-lo)>1){
int pivot = partition(a,lo,hi);
sort(a,lo,pivot);
sort(a,pivot+1,hi);
}
}
// partition the subarray a[lo .. hi] by returning an index j
// so that a[lo .. j-1] <= a[j] <= a[j+1 .. hi]
private int partition(Comparable[] a, int lo, int hi) {
//find middle
int pivotIndex = (hi+lo)/2;
//pick pivot
Comparable pivot = a[pivotIndex];
//create left and right pointers
int left = lo, right = hi;
//start comparing
//compare until left passes right
while(left<right){
//while left is less than pivot move on
while(a[left].compareTo(pivot) < 0) left++;
//while right is greater than pivot move on
while(a[right].compareTo(pivot) > 0) right--;
//if the pointers have passed each other we're done
//if a[left] is greater than a[right] swap them
if(a[left].compareTo(a[right]) > 0){
Comparable holder = a[left];
a[left] = a[right];
a[right] = holder;
//increment/decrement
left++; right--;
}
}
return right;
}
是javascript吗? :p – 2013-03-22 23:24:00
@GrzegorzKaczan很确定它不是。重新签署到Java。 – 2013-03-22 23:29:36