What is the difference between these two nloglog(n) sorting algorithms? (Andersson et al., 1995 vs.

Posted by Yktula on Stack Overflow See other posts from Stack Overflow or by Yktula
Published on 2010-05-24T00:00:12Z Indexed on 2010/05/24 0:41 UTC
Read the original article Hit count: 778

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

© Stack Overflow or respective owner

Related posts about algorithm

Related posts about language-agnostic