Explain how a recursive algorithm uses stack with suitable illustrative stack diagram.

Q10 Please explain your answers

Design a sorting algorithm that takes in as input a stack of comparable elements and returns the data in a sorted stack. This stack should have the smallest element as its first element, and the largest element as the top element. The only data structure you can use in this design is a stack structure as we defined in class (i.e. you cannot push all the data into an array, sort that array, and then push that array into the result stack), but you may make use of temporary datapoints and the standard Boolean operations (<, >, <=, >=, ==, !=). These temporary datapoints can include a temp stack. What is the run time of your algorithm?

Explain how the function call stack works in most modern programming languages.

The confined and unbounded stack implementations each have their own unique characteristics, therefore please describe them.

One linear structure might be more applicable than another. (A) Can a Stack be used to implement a Queue? How complex are the Queue operations individually? (b) Can a Stack be implemented using a Queue? What level of complexity do the different Stack techniques have?

Describe the variations between the restricted and unbounded stack implementations.

solution for subpart 3

What is infinite recursion? How is it related to stack overflow errors?

What does a stack pointer really do?