快速排序——分治
- 确定分界点:q[l]、q[(l+r)/2]、q[r]
- 调整区间:重点
- 递归处理左右两段
public class QuickSort {
public static void quickSort(int[] arr, int l, int r) {
if(l >= r) return;
int x = arr[l];
int i = l - 1;
int j = r + 1;
while(i < j) {
do {
i++;
}while(arr[i] < x);
do {
j--;
}while(arr[j] > x);
if(i < j) {
int t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
quickSort(arr,l,j);
quickSort(arr,j+1,r);
}
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入数组元素个数:");
int n = sc.nextInt();
int[] arr = new int[n];
for(int i = 0;i <arr.length;i++) {
arr[i] = sc.nextInt();
}
quickSort(arr,0,n-1);
System.out.print("排好序后的数组为:");
for(int i = 0;i < arr.length;i++) {
System.out.print(arr[i] + " ");
}
}
}
quick_sort()方法第二种
public class QuickSort1 {
public static void quickSort(int[] arr, int l, int r) {
if(l >= r) return;
int x = arr[(l + r + 1)/2];
int i = l - 1;
int j = r + 1;
while(i < j) {
do {
i++;
}while(arr[i] < x);
do {
j--;
}while(arr[j] > x);
if(i < j) {
int t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
quickSort(arr,l,i-1);
quickSort(arr,i,r);
}
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入数组元素个数:");
int n = sc.nextInt();
int[] arr = new int[n];
for(int i = 0;i <arr.length;i++) {
arr[i] = sc.nextInt();
}
quickSort(arr,0,n-1);
System.out.print("排好序后的数组为:");
for(int i = 0;i < arr.length;i++) {
System.out.print(arr[i] + " ");
}
}
}