快速排序是冒泡排序的一种改进。基本思想是基于分治。下面直接给出代码:
public static 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 static int getMiddle(int[] list, int low, int high) {
int temp = list[low];// 数组的第一个作为中轴
while (low < high) {
while (low < high && list[high] >= temp) {
high--;
}
list[low] = list[high];// 比中轴小的记录移到低端
while (low < high && list[low] <= temp) {
low++;
}
list[high] = list[low];// 比中轴大的记录移到高端
}
list[low] = temp;// 中轴记录到尾 基准元素遍历一次归位
return low;
}
public static void main(String[] args) {
int[] list = { 4, 7, 5, 3, 2, 8, 1 };
System.out.println("排序前:\n");
for (int integer : list) {
System.out.print(integer + " ");
}
quickSort(list, 0, list.length - 1);
System.out.println("排序后:\n");
for (int integer : list) {
System.out.print(integer+" ");
}
}