INSERTION SORT
MERGE SORT
QUICK SORT
HEAP SORT
public void quicksort(int[] list, int low, int high)
{
if (low < high) {
int mid = partition(list,low,high);
quicksort(list,low,mid-1);
quicksort(list,mid+1,high);
}
}