记录一次错误的快速排序
这是一个错误的快速排序,但是我找了很久,才把错误找出来,我想记下来,看有人知道是哪里出错了吗?
public static void exchangedInteger(List<Integer> list,int i,int j){
if(i!=j){
list.set(i,list.get(i)^list.get(j));
list.set(j,list.get(i)^list.get(j));
list.set(i,list.get(i)^list.get(j));
}
}
public static List<Integer> quickSort(List<Integer> list,int index1,int index2){
if(list.size()==0){
return null;
}
List<Integer> temp = new LinkedList<>(list);
if(index1>=index2){
return temp;
}
int mid=quickPartition(temp,index1,index2);
quickSort(temp,index1,mid-1);
quickSort(temp,mid+1,index2);
return temp;
}
public static int quickPartition(List<Integer> list ,int left,int right){
int mid=left;
for(int i=left;i<=right-1;++i){
if(list.get(i)<=list.get(right)){
exchangedInteger(list,i,mid);
mid+=1;
}
}
exchangedInteger(list,mid,right);
return mid;
}在这里插入代码片