zhangxp1998

3 ms·

1. 1.▲
   by zhangxp1998 7y ago

   It's just quick sort with insertion sort for small base cases.
2. 2.▲
   by zhangxp1998 7y ago

   " It begins with quicksort, it switches to heapsort when the recursion depth exceeds a level based on (the logarithm of) the number of elements being sorted and it switches to insertionsort when the number of elements is below some thr
3. 3.▲
   by zhangxp1998 7y ago

   I agree is unfair. The point of my benchmark was that the OP's claim "quad sort is faster than quicksort" is false.
4. 4.▲
   by zhangxp1998 7y ago

   I looked at disassembly of generated binary, sure, function calls inside quad sort were also inlined.
5. 5.▲
   by zhangxp1998 7y ago

   See https://gist.github.com/zhangxp1998/0e2fa30656c894017d183e0d... for a comparison of quadsort with C++'s std::sort. The compare functions are inlined.
6. 6.▲
   by zhangxp1998 7y ago

   qsort has to invoke your comparison function repeatedly, which incurs a lot of overhead. Try C++'s std::sort
7. 7.▲
   by zhangxp1998 7y ago

   Okay, so you are comparing single-threaded GNU wc with your multi-threaded Go implementation? That's fair.