Deliberately bad algorithms

A place to discuss the science of computers and programs, from algorithms to computability.

Formal proofs preferred.

Moderators: phlip, Moderators General, Prelates

Posts: 2180
Joined: Wed Aug 18, 2010 4:15 am UTC

Re: Deliberately bad algorithms

Postby Derek » Fri Apr 14, 2017 6:48 pm UTC

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).

Return to “Computer Science”

Who is online

Users browsing this forum: No registered users and 14 guests