Stack and Queues

A group of students wish to make use of a stack $S$ and a queue $Q$ so as to sort a given sequence of integers, which is initially stored in an array $A$. At the start, they pushed all the numbers from $A$ to $S$. The proposed algorithm is as given below. Repeat the following steps till the sorted sequence is obtained in $A$. - Keeping a track of the maximum and the minimum number, pop all t