Wait, did it get your name right? It's kinda buggy for me, it draws every letter twice for me (twice in 3D, of course it has to draw it twice in 2D).

Nevermind, I managed to squint enough to get the letters to combine into a perfect image. It should not be possible to get more than 1 correct 3D image, the period of the background should be increased.

Yea, change a certain .h file and you can go get a cup of coffee while waiting for the build to end. This can't ever happen with Java/C#.

No. For radix sort this constant factor is quite low, so it outperforms std::sort in most cases.

Try sorting a million integers, my results are: std::sort: 60 ms; radix-sort (LSB, hand coded, less than 20 lines): 11 ms. It gets even better when you mix MSB with LSB for better locality.

No, there are no problems with doubles or negative integers. For sizeof(key_value)<=16 B (8 for key, 8 for pointer), radix is the best sort on desktop computers.

Please note that radix sort is easy to implement to work correctly with doubles, Table 1 is misleading.