package com.phj.math;
public class QuickSort {
public static void main(String[] args) {Quick qs = new Quick();int data[] = { 44, 22, 2, 32, 54, 22, 88, 77, 99, 11 };qs.data = data;qs.sort(0, qs.data.length - 1);qs.display();
}
}
class Quick {public int[] data = null;
public int partition(int array[], int low, int high) {int key = array[low];while (low < high) {while (low < high && array[high] >= key)high--;array[low] = array[high];while (low < high && array[......
阅读全文