本帖最后由 GKAirzzzzz 于 2017-3-1 11:56 编辑
快排算法代码[Java] 纯文本查看 复制代码
public class QuickSort {
public static void main(String[] args){
Integer[] list={34,3,53,2,23,7,14,10};
QuickSort qs=new QuickSort();
qs._quickSort(list,0,list.length-1);
for(int i=0;i<list.length;i++){
System.out.print(list[i]+" ");
}
System.out.println();
}
public void _quickSort(Integer[] list, int low, int high) {
if (low < high) {
int middle = getMiddle(list, low, high); //将list数组进行一分为二
System.out.println("Middle:"+middle);
_quickSort(list, low, middle - 1); //对低字表进行递归排序
_quickSort(list, middle + 1, high); //对高字表进行递归排序
}
}
public int getMiddle(Integer[] list, int low, int high) {
int tmp = list[low]; //数组的第一个作为中轴
while (low < high) {
while (low < high && list[high] >= tmp) {
high--;
}
list[low] = list[high]; //比中轴小的记录移到低端
while (low < high && list[low] <= tmp) {
low++;
}
list[high] = list[low]; //比中轴大的记录移到高端
}
list[low] = tmp; //中轴记录到尾
return low; //返回中轴的位置
}
} |