ou may only operate on the stacks WORK and TEMP, supporting their ADT operations of PUSH (S, X), POP (S, X), and EMPTYSTACK (S), where X is an element or variable to be pushed into or popped out of the stack and S denotes the stack itself. If necessary to complete the procedures, you may also utilise one variable. i) How can you determine the least element that was pushed into WORK given n different random integers that are going be placed into it? You are allowed to employ a single variable. ii) How can you determine the maximum element that was put into Work, given n different random integers, while making sure that the items placed in Work are arranged in ascending order, with the maximum element starting at the bottom of the stack? You are allowed to utilise the temporary stack TEMP as well as a single variable. iii) How can you create the sorted list in the array using just stacks given an array A[1: n] of unique random numbers?
You may only operate on the stacks WORK and TEMP, supporting their ADT operations of PUSH (S, X), POP (S, X), and EMPTYSTACK (S), where X is an element or variable to be pushed into or popped out of the stack and S denotes the stack itself. If necessary to complete the procedures, you may also utilise one variable.
i) How can you determine the least element that was pushed into WORK given n different random integers that are going be placed into it? You are allowed to employ a single variable.
ii) How can you determine the maximum element that was put into Work, given n different random integers, while making sure that the items placed in Work are arranged in ascending order, with the maximum element starting at the bottom of the stack? You are allowed to utilise the temporary stack TEMP as well as a single variable.
iii) How can you create the sorted list in the array using just stacks given an array A[1: n] of unique random numbers?
Step by step
Solved in 4 steps
