数据结构之------快速排序

public class QuickSort {
public static void main(String[] args) {
int[] a = { 45, 4, 6, 42, 123, 1, 23, 45, 234, 11, 24, 547, 2 };
QuickSort.quickSort(a, 0, a.length - 1);
for (int i : a) {
System.out.println(i);
}
}

public static void quickSort(int[] data, int low, int high) {
int i = low;
int j = high;
int pivot = data[low];
if (i < j) {
while (i < j) {
while (pivot < data[j] && i < j)
j--;
if (i < j) {
data[i] = data[j];
i++;
}
while (pivot > data[i] && i < j)
i++;
if (i < j) {
data[j] = data[i];
j--;
}
}
data[i] = pivot;
QuickSort.quickSort(data, low, i - 1);
QuickSort.quickSort(data, i + 1, high);
}
}
}