What is the difference between these two nloglog(n) sorting algorithms? (Andersson et al., 1995 vs.
- by Yktula
Swanepoel's comment here lead me to this paper. Then, searching for an implementation in C, I came across this, which referenced another paper on an algorithm described here.
Both papers describe integer sorting algorithms that run in O(nloglog(n)) time. What is the difference between the two? Have there been any more recent findings about this topic?
Andersson et al., 1995
Han, 2004