Question

What will be the auxiliary space complexity of the code to rotate an array by using the reversal algorithm (d = number of rotations)?

(a) O(1)

(b) O(n)

(c) O(d)

(d) O(n*d)

The query is from Arrays Types in chapter Arrays Types of Data Structures & Algorithms I

I got this question by my college director while I was bunking the class.

Answer 1

Right answer is (a) O(1)

Explanation: The reversal algorithm for rotating an array does not require any auxiliary space. So the auxiliary space complexity will be O(1).