Page 4 of 4

Re: Deliberately bad algorithms

Posted: Fri Apr 14, 2017 6:48 pm UTC
by Derek
I recall it being shown in one of my freshman CS classes that Union Find is O(log*(n)), however this bound is not tight. It's actually O(inverse ackermann), but showing that is much more difficult.

But I feel like we've gone maximally off topic if we're now talking about O(inverse ackermann).