快速排序:
图解:(来源于百度百科)
实现代码:
public class QuickSort {
public static void sort(double array[], int low, int hight) {
int i, j;double index;
if (low > hight) {
return;
}
i = low;
j = hight;
index = array[i];
while (i < j) {
while (i < j && array[j] >= index)
j--;
if (i < j)
array[i++] = array[j];
while (i < j && array[i] < index)
i++;
if (i < j)
array[j--] = array[i];
}
array[i] = index;
sort(array, low, i - 1);
sort(array, i + 1, hight);
}
public static void quickSort(double array[]) {
sort(array, 0, array.length - 1);
}
}