Description:

Module to implement a quicksort routine in charge of sorting the HSPs

Briefing:

int Split(HSP** hsps,int i, int j) int RSplit(HSP** hsps,int i, int j)

Fix a pivot element and then splits the input array HSP(i..j) into the elements with a value lower (left half) and higher (right half). The R (reverse) routine is designed to obtain the reverse sorting.

void quickSort(HSP** hsps, int i, int j) void RquickSort(HSP** hsps, int i, int j)

Main recursive routine of quicksort. The original array is recursively divided into fragments of elements which will be sorted following a divide and conquer algorithm. The R (reverse) routine is designed to obtain the reverse sorting.

void SortHSPs(packHSP* p)

Main routine of the module to call quicksort for sorting HSPs in each frame and strand.

Enrique Blanco Garcia © 2003