Re:Galactic Algorithm
by carlmr on Saturday October 05, 2019 @05:32AM
(#21164605)
They mention O(n log* n) being quasi linear time, I had to look up log * n because I never saw this before.
[ Parent
| on HN ]
And then there's O(n alpha(n)), where alpha(n) is an inverse the Ackermann function, and which grows even more slowly than log* n. The famous union-find algorithm has this complexity.
Re:Galactic Algorithm
by MaxBarraclough on Saturday October 05, 2019 @09:58AM
(#21165503)
Wikipedia link: https://en.wikipedia.org/wiki/Log-star