快速排序Java
package test;
import java.util.*;
class Main {
public static void main(String[] args) {
int a[] = { 12, 3, 4, 64, 5, 55, 6 };
quickSort(a, 0, a.length - 1);
for (int i = 0; i < a.length; i++)
System.out.print(a[i] + " ");
}
public static void quickSort(int[] a, int low, int high) {
if (low < high) {
int i = low, j = high;
int key = a[i];
while (i < j) {
while (i < j && a[j] >= key) {
j--;
}
if (i < j) {
a[i] = a[j];
}
while (i < j && a[i] <= key) {
i++;
}
if (i < j) {
a[j] = a[i];
}
}
a[i] = key;
quickSort(a, low, i - 1);
quickSort(a, i + 1, high);
}
}
}