Question: The question is: What would happen to the time complexity (Big-oh) of the methods in an array implementation of the stack if the top of
The question is:
What would happen to the time complexity (Big-oh) of the methods in an array implementation of the stack if the top of the stack were at position 0? Explain.
Isn't the top of the stack always position 0? I know the goal is to optimize time complexity, I'm just kind of confused at the wording of this question.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
