Question

What is the time complexity of reversing a word using stack algorithm?

(a) O (N log N)

(b) O (N^2)

(c) O (N)

(d) O (M log N)

I want to ask this question from Reverse a Word using Stack in chapter Application of Stacks of Data Structures & Algorithms I

I had been asked this question in class test.

Answer 1

Correct choice is (c) O (N)

For explanation: The time complexity of reversing a stack is mathematically found to be O (N) where N is the input.