快速排序算法是基于分支策略的另一个排序算法,最关键的步骤是找到基准点
java实现:
- public class quickSort {
- inta[]={49,38,65,97,76,13,27,49,78,34,12,64,5,4,62,99,98,54,56,17,18,23,34,15,35,25,53,51};
- public quickSort(){
- quick(a);
- for(int i=0;i<a.length;i++)
- System.out.println(a[i]);
- }
- //找基准点的方法
- public int getMiddle(int[] list, int low, int high) {
- int tmp = list[low]; //数组的第一个作为中轴
- while (low < high) {
- while (low < high && list[high] >= tmp) {
- high--;
- }
- // 当list[high]<tmp时,把小的记录调到低端
- list[low] = list[high]; //比中轴小的记录移到低端
- while (low < high && list[low] <= tmp) {
- low++;
- }
- //当list[low]>tmp时,把list[low]调到高端
- list[high] = list[low]; //比中轴大的记录移到高端
- }
- //当low>high,即基准点到数组末尾
- list[low] = tmp; //中轴记录到尾
- return low; //返回中轴的位置
- }
- //快速排序
- public void _quickSort(int[] 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(int[] a2) {
- if (a2.length > 0) { //查看数组是否为空
- //默认初始位置为基准点
- _quickSort(a2, 0, a2.length - 1);
- }
- }
- }