>write naive sort implementation
>outperform glibc's qsort
Write naive sort implementation
Joseph Reyes
Other urls found in this thread:
cs.rpi.edu
twitter.com
Dominic Lewis
Yeah, that naive sort is one hell of an algorithm.
Nathaniel Bennett
>wrote radix
>3 times faster than std sort on randomly generated uint's
feels good man
Landon Reyes
same
Juan Edwards
>work-specific tool works better than Swiss army knife
No shit.
Jordan Hernandez
chansort
>for x, wait x, then print x
Blake Lopez
>not writing a custom, inlined, recursive template metaprogramming mergesort instead of using the slow function pointer based C-sort.
Liam Kelly
How many elements?
I could outperform you with bubblesort if all the elements fit in a cache line.
Jackson Peterson
>bubble sort
Brody Morales
cs.rpi.edu
The C++ master race dabs of C-faggots once again.