Which of the following algorithm to rotate an array has the maximum time complexity?
(a) rotate elements one by one
(b) juggling algorithm
(c) reversal algorithm
(d) using a temporary array
I would like to ask this question from Arrays Types in section Arrays Types of Data Structures & Algorithms I
This question was posed to me in examination.