package sort;
public class QuickSort1 {
public static void QuickSort(int array[],int low,int high){
if(low >= high)
return;
int i = low;
int j = high;
int key = array[i];
while(i < j){
while(i < j && array[j] >= key)
j--;
array[i] = array[j];
while(i < j && array[i] <= key)
i++;
array[j] = array[i];
array[i] = key;
}
QuickSort(array, low, i - 1);
QuickSort(array, i + 1, high);
}
public static void main(String[] args) {
int array[] = {19, 17, 16, 12, 9, 15, 1, 2, 11, 7, 3, 10, 14};
QuickSort(array, 0, array.length - 1);
for(int i=0;i<array.length;i++){
System.out.print(array[i]+" ");
}
}
}
快速排序
最新推荐文章于 2023-12-01 23:14:38 发布