On 6/4/2012 2:12 PM, Orchid Win7 v1 wrote:
> I was reading a description for a computer algorithm. Get this, the
> authors claim that the time-complexity is proportional to the "inverse
> Ackermann function".

Union-find structures I assume?


> (Quite how any algorithm's run-time could ever be proportional to
> something as obscure and arbitrarily defined as the inverse of the
> Ackermann function, I have no idea... I guess now I've seen everything.)

You could of course look a proof and read through it.

Post a reply to this message