You must log in or register to comment.
Guaranteed to sort the list in nearly instantaneous time and with absolutely no downsides that are capable of objecting.
Except you missed a bug in the “check if it’s sorted” code and it ends up destroying every universe.
There’s a bug in it now, that’s why we’re still here.
You still have to check that it’s sorted, which is O(n).
We’ll also assume that destroying the universe takes constant time.
In the universe where the list is sorted, it doesn’t actually matter how long the destruction takes!
amortized O(0)
We’ll also assume that destroying the universe takes constant time.
Well yeah just delete the pointer to it!
universe.take()
deleted by creator
