i) Given n distinct random numbers that are to be pushed into WORK, how can you find the maximum element that was pushed into it, all the while ensuring that the elements stored in WORK are in their descending order with the maximum element beginning at the bottom of stack? You are permitted to use a lone variable and a temporary stack TEMP. ii) Given an array A[1: n] of distinct random numbers how can you obtain the sorted list in the array, making use of stacks alone?
You are allowed to operate on a stack WORK and a temporary stack TEMP (if
needed) supporting their ADT operations of PUSH (S,X), POP (S, X) and
EMPTYSTACK (S) only, where X represents an element/variable to be pushed in or
popped out of the stack and S represents a stack. You are also permitted to use one variable if needed to carry out the operations.
i) Given n distinct random numbers that are to be pushed into WORK, how can
you find the maximum element that was pushed into it, all the while ensuring that
the elements stored in WORK are in their descending order with the maximum
element beginning at the bottom of stack? You are permitted to use a lone variable
and a temporary stack TEMP.
ii) Given an array A[1: n] of distinct random numbers how can you obtain the
sorted list in the array, making use of stacks alone?
Step by step
Solved in 3 steps
