5 ms·
Of course, this is nitpicking :). For all practical purpose, this O(log n) is O(1). If you are interested, I can try to recover the proof that the rotation ste
by def-lkb 4y ago
Of course, this is nitpicking :). For all practical purpose, this O(log n) is O(1).
If you are interested, I can try to recover the proof that the rotation step can be done in O(n), thus allowing to apply the master theorem on the main recursion and getting the O(n log n) result.
- scandum 4y agoI'm not that interested as I'd prefer to count each move and prove it that way, but perhaps Peter (orlp) is interested?