next up previous
Next: Quicksort Paralelo - Análise Up: Exercício 1 Previous: Exercício 1

Quicksort Paralelo - Algoritmo

 

 
void quicksort(int a[], int left, int right){

if(left < right) {

int pivot = choosePivot(a,left,right);

Partition p = partition(a, left, right, pivot);

cobegin

quicksort(a,left,p.right);

tex2html_wrap_inline702

quicksort(a,p.left,right);

coend;

}

}



Osvaldo Sergio F. de Carvalho
Wed Mar 19 14:56:39 EST 1997