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?

Code in C One of the applications of a stack is to backtrack - that is, to retrace its steps. As an example, imagine we want to read a list of items, and each time we read a negative number we must backtrack and print the five numbers that come before the negative number and then discard the negative number. Use a stack to solve this problem. Use a stack and push them into the stack (without printing them) until a negative number is read. At this time, stop reading and pop five items from the stack and print them. If there are fewer than five items in the stack, print an error message and stop the program. After printing the five items, resume reading data and placing them in the stack. When the end of the file is detected, print the message and the items remaining in the stack. Sample Output 1 2 3 4 5 6 7 -1 7 6 5 4 3 9 6 4 3 -2 3 4 6 9 2 -3 Number of items left is less than five! Program is terminating!     Project name : Backtrack Filenames: backtrack.h, backtrack.c,…

Python:  using a stack, implement a function that takes in an arithmetic expression, and evaluates it. Supported operations are + and -, which have the same precedence.

What are the operations that can be performed on a stack?

Learn how effective the stack is when allowed to function as itself.

Q10 Please explain your answers

in java pls and thank you!

In C++, develop an algorithm that adds the value val to a queue object Q. The queue is represented using an array data of size s. The algorithm should assume that the queue is not full. The most recently added item is at index r (rear), and the least recently added item is at index f (front). If the queue is empty, r = f = -1.

Java data struc

Please help with the following in Java Write a Java program create a stack with elements pushed 1, 2, 3, 4 and 5, removes the middle element. Note that you may use only push(), pop(), peek() and empty() methods of the stack.