presentación-PDF

Código QuickSort
void quickSort (int [] A, int i, int j)
{
int indicePivote = buscaPivote(i, j);
if (indicePivote != -1)
{
int pivote = A[indicePivote];
intercambiar(indicePivote,j);
int k = particion(i,j,pivote);
quickSort(A, i, k-1);
quickSort(A, k,j);
}
}