I think the time requirement stated for solution 4 in problem 189. Rotate Array is too pessimistic. It says:\n\n"Time complexity: O(n). n elements are reversed a total of **three** times."\n\nHowever, even though there are three calls to reverse, the elements moved by the second and third call do not overlap. So should it not rather be:\n\n"Time complexity: O(n). n elements are reversed a total of **two** times."?\n\nThis is surely lost in O notation, but in real life a factor of 3x vs 2x is quite something.

I think the time requirement stated for solution 4 in problem 189. Rotate Array is too pessimistic. It says:\n\n"Time complexity: O(n). n elements are reversed 