No replies to this topic

[Serialcek]

Hello everyone!
Can anyone (who/if understand how Stefan's integer sorting algorithm works) describe me in easy words how the algorithm works?
All I know about it is that it's an algorithm with time complexity O(n log log n).
I have to know it for my "homework". On the web I just found some articles but they are so difficult to read (for me). :blushing:
If anyone can help it would be appreciated.
I have to know how the algorithm works and how in the algorithm the keys are used.

Thx in advance and sorry for my "Tarzan" English :)