Compare sorting algorithms' performance: Difference between revisions

m
(Debugged and updated D entry: heapfy is not a heapSort.)
Line 669:
int doublecompare( const void *a, const void *b )
{
if ( *(const double *)a ==< *(const double *)b ) return 0-1;
ifelse (return *(const double *)a <> *(const double *)b ) return -1; else return 1;
}
int action_qsort(int size)
Anonymous user