@FrankW I was assuming you could answer the right-rotation question; I seemed to remember we talked about something similar a while ago, but I could not remember the specifics.
Nice answer, btw; are you willing to create some graphics? Otherwise, maybe I'll draw some up later.
I know that Big O is used to bound worst case running time. So an algorithm with running time $O(n^5)$ means its running time in worse case is less than $n^5$ asymptotically.
Similarly, one can say that for example merge sort's running time is $O(n^2)$ which is correct. But we know that there i...
@Raphael I initially took it as asking for the word "tight bound". I doubt that is covered explicitly in the reference questions.
And with the other part of my answer, we probably have a similar situation as a few days ago: It may be covered by the reference questions, but only in passing.
@FrankW If it's only that term the OP is after, then yes, that warrants the new answers. My impression was that they have more fundamental problems, though.
I know that Big O is used to bound worst case running time. So an algorithm with running time $O(n^5)$ means its running time in worse case is less than $n^5$ asymptotically.
Similarly, one can say that for example merge sort's running time is $O(n^2)$ which is correct. But we know that there i...
