quicksort swap

void quicksort ( void *  v[], int  left, int  right, int(*)(void *, void *)  comp  ) Definition at line 64 of file quicksort.cc. Referenced by DBGfindDiagonals(), MC_partitionY(), partitionY(), quicksort(), and directedLine::sortAllPolygons(). { int i, last; if(left >= right) /*do nothing if array contains */ return; /*fewer than two elements*/ swap(v, left, (left+right)/2); last = left; for(i=left+1; i<=right; i++) if((*comp)(v[i], v[left])<0) swap(v, ++last, i); swap(v, left, last); quicksort(v, left, last-1, comp); quicksort(v, last+1, right, comp); }