Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
A language has not array as a data type but it has stack as a data type and one can declare stack’s; and push, pop and isempty operations are defined.
So how can we implement array using two stacks and above operations?
Horribly inefficient – but:
Stack 1 Contains the details
Stack 2 is empty.
To go through the array, Pop Stack 1 , when you want the next one, push the previous one into stack 2 and pop stack 1 again. Repeat until ‘isempty’.
If you want the Nth value, pop the not empty stack N times while pushing the unneeded ones into the other stack. Then when you’re done playing with it, empty it into the other stack. Note that this;ll flip the order.