> generalized sorting is O(n)
What do you mean by generalized sorting and how isn't this affected by the comparison sorting lower bound?
Do you have a source?
What do you mean by generalized sorting and how isn't this affected by the comparison sorting lower bound?
Do you have a source?
Secondly, I've tried to get the white paper exposed here and it generally goes over like a lead balloon but:
http://www.diku.dk/hjemmesider/ansatte/henglein/papers/hengl...
Is the technique. It's an imposing 80 page paper even dedicated educators like Edward Kmett has trouble explaining trivially, but there is a talk here by the author to help sum it up: https://www.youtube.com/watch?v=sz9ZlZIRDAg
We've had some of Henglein's associates here to talk about it, too.
There is a Haskell implementation and it can really speed up certain types of operations. It's tricky to get the constants low in Haskell, but Kmett seems to have done a pretty good job.