排序之快排

public class QuickSort {   public void sort(int[] array, int i, int j){   int location;   if(i<j){   location = partition(array, i, j);   sort(array, i, location-1);   sort(array, location+1, j);   }      }   public int partition(int[] array, int i, int j){   int temp = array[j];   int index = i-1;   while(i<j){  if(array[i]<=temp){  swap(array,++index,i);  }  i++;   }   swap(array,++index,j);      return index;   }      void swap(int[] array,int i, int j){int temp = array[i];array[i] = array[j];array[j] = temp;}}