Random int test record on mac about blitsort HOT 2 CLOSED

Did you compile using gcc -O3 ? The binary search requires the -O3 optimization for optimal performance, and likely other routines do as well.

Your cmp_int function is incorrect, try:

int cmp_int(const void * a, const void * b)
{
        int fa = *(int *)a;
        int fb = *(int *)b;

        return fa - fb;
}

from blitsort.

Thanks!
I used the "gcc -O3 blitsorttest.c -o test" to compile the source code.
The output program revealed the blitsort is faster than qsort when sort the random int.
Thank you for your directing. I'm a noob.

from blitsort.