Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
10. Write a program which will rearrange and sort a stack of integer values, using two other stacks. The following algorithm describes how to do this: 1. Start with a stack of numbers named primary and two empty stacks named 1ower and higher. 2. Pop the first number from your primary stack and put it into the lower stack 3. Pop the next number from your primary stack, if it is smaller than the number you previously put into the 1ower stack, then add it to the lower stack, otherwise put it in the higher stack. 4. Repeat step 3 until the primary stack is empty. 5. Pop each of the elements from the lower stack and add them back into the primary stack. 6. Pop each element of the higher stack. If the value is greater than the value at the head of the primary stack, then add it onto the primary stack, otherwise add the number into the lower stack. 7. Repeat the process from steps 3 through to step 6 until both the higher and lower stacks contain no elements. At this point, the primary stack

10. Write a program which will rearrange and sort a stack of integer values, using two other stacks. The following algorithm describes how to do this: 1. Start with a stack of numbers named primary and two empty stacks named 1ower and higher. 2. Pop the first number from your primary stack and put it into the lower stack 3. Pop the next number from your primary stack, if it is smaller than the number you previously put into the 1ower stack, then add it to the lower stack, otherwise put it in the higher stack. 4. Repeat step 3 until the primary stack is empty. 5. Pop each of the elements from the lower stack and add them back into the primary stack. 6. Pop each element of the higher stack. If the value is greater than the value at the head of the primary stack, then add it onto the primary stack, otherwise add the number into the lower stack. 7. Repeat the process from steps 3 through to step 6 until both the higher and lower stacks contain no elements. At this point, the primary stack

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question
10. Write a program which will rearrange and sort a stack of integer values, using two other stacks. The following algorithm describes how to do this: 1. Start with a stack of numbers named primary and two empty stacks named 1ower and higher. 2. Pop the first number from your primary stack and put it into the 1ower stack 3. Pop the next number from your primary stack, if it is smaller than the number you previously put into the lower stack, then add it to the lower stack, otherwise put it in the higher stack. 4. Repeat step 3 until the primary stack is empty. 5. Pop each of the elements from the lower stack and add them back into the primary stack. 6. Pop each element of the higher stack. If the value is greater than the value at the head of the primary stack, then add it onto the primary stack, otherwise add the number into the lower stack. 7. Repeat the process from steps 3 through to step 6 until both the higher and lower stacks contain no elements. At this point, the primary stack will be sorted.
Transcribed Image Text:10. Write a program which will rearrange and sort a stack of integer values, using two other stacks. The following algorithm describes how to do this: 1. Start with a stack of numbers named primary and two empty stacks named 1ower and higher. 2. Pop the first number from your primary stack and put it into the 1ower stack 3. Pop the next number from your primary stack, if it is smaller than the number you previously put into the lower stack, then add it to the lower stack, otherwise put it in the higher stack. 4. Repeat step 3 until the primary stack is empty. 5. Pop each of the elements from the lower stack and add them back into the primary stack. 6. Pop each element of the higher stack. If the value is greater than the value at the head of the primary stack, then add it onto the primary stack, otherwise add the number into the lower stack. 7. Repeat the process from steps 3 through to step 6 until both the higher and lower stacks contain no elements. At this point, the primary stack will be sorted.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Stack
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS