package Sort;
/*
* 快速排序
*/
public class Kuaisu {
public int num=1;
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Integer[] list={34,3,53,2,23,7,14,10};
Kuaisu qs=new Kuaisu();
qs.quick(list);
System.out.println();
System.out.println("排序结果:");
for(int i=0;i<list.length;i++){
System.out.print(list[i]+" ");
}
System.out.println();
}
public int getMiddle(Integer[] list, int low, int high) {
int tmp = list[low]; //数组的第一个作为中轴
System.out.println("-----排序---");
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]; //比中轴大的记录移到高端
for(int i=0;i<list.length;i++){
System.out.print(list[i]+" ");
}
System.out.println();
}
list[low] = tmp; //中轴记录到尾
System.out.println("=====排序"+num+"结束====");
for(int i=0;i<list.length;i++){
System.out.print(list[i]+" ");
}
System.out.println();
num++;
return low; //返回中轴的位置
}
public void _quickSort(Integer[] list, int low, int high) {
if (low < high) {
int middle = getMiddle(list, low, high); //将list数组进行一分为二
_quickSort(list, low, middle - 1); //对低字表进行递归排序
_quickSort(list, middle + 1, high); //对高字表进行递归排序
}
}
public void quick(Integer[] str) {
if (str.length > 0) { //查看数组是否为空
_quickSort(str, 0, str.length - 1);
}
}
}
运行结果
—–排序—
10 3 53 2 23 7 14 53
10 3 14 2 23 7 14 53
=====排序1结束====
10 3 14 2 23 7 34 53
—–排序—
7 3 14 2 23 14 34 53
7 3 2 2 23 14 34 53
=====排序2结束====
7 3 2 10 23 14 34 53
—–排序—
2 3 2 10 23 14 34 53
=====排序3结束====
2 3 7 10 23 14 34 53
—–排序—
2 3 7 10 23 14 34 53
=====排序4结束====
2 3 7 10 23 14 34 53
—–排序—
2 3 7 10 14 14 34 53
=====排序5结束====
2 3 7 10 14 23 34 53
排序结果:
2 3 7 10 14 23 34 53