quicksort.java

A quicksort algorithm sourcecode that together with the sourcecode for equalTo, sorts a integer arra

public class quickSort{
  public static void main(String a[]){
    int i;
    int k = 13;
    int array[] = {12,9,4,99,120,1,3,10,13};

    quickSort(array,0,array.length-1);
    for(i = 0; i <array.length; i++){
    	}
    equalTo myFormatSWNObject = new equalTo(k, array);
  }

  public static void quickSort(int array[],int low, int high){
    int lo = low;
    int hi = high;
    if (lo >= high) {
      return;
    }
    int mid = array[(lo + hi) / 2];
    while (lo < hi) {
      while (lo<hi && array[lo] < mid) {
        lo++;
      }
      while (lo<hi && array[hi] > mid) {
        hi--;
      }
      if (lo < hi) {
        int temp = array[lo];
        array[lo] = array[hi];
        array[hi] = temp;
      }
    }
    if (hi < lo) {
      int temp = hi;
      hi = lo;
      lo = temp;
    }
    quickSort(array, low, lo);
    quickSort(array, lo == low ? lo+1 : lo, high);
  }
}