This program will use dynamic allocation to implement a linked list to keep an ascending sorted list of numbers. The input data consists of two fields: a single character and an integer value. The single character gets interpreted as one of the following: A - represents a value that is to be added to the linked list D - represents a value to be deleted from the linked list P - indicates that all values are to be printed in ascending order R - indicates that all values are to be printed in descending order (use recursion) The character is only used to determine which process is to be executed; it should not be printed, entered into the linked list, or processed in any other way. You should use pointers (dynamic allocation) in this program, no classes, no libraries (STL). The main program should be mainly function calls. Process input data until end of file. All output should be sent to an output file and be appropriately formatted and clearly labeled. Keep a running log of everything that is going on in the processing. Your program should work for any data set.
This program will use dynamic allocation to implement a linked list to keep an ascending sorted list of numbers. The input data consists of two fields: a single character and an integer value. The single character gets interpreted as one of the following: A - represents a value that is to be added to the linked list D - represents a value to be deleted from the linked list P - indicates that all values are to be printed in ascending order R - indicates that all values are to be printed in descending order (use recursion) The character is only used to determine which process is to be executed; it should not be printed, entered into the linked list, or processed in any other way. You should use pointers (dynamic allocation) in this program, no classes, no libraries (STL). The main program should be mainly function calls. Process input data until end of file. All output should be sent to an output file and be appropriately formatted and clearly labeled. Keep a running log of everything that is going on in the processing. Your program should work for any data set.
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
Related questions
Question
Got stuck on this problem, please help!
![This program will use dynamic allocation to implement a linked list to keep an ascending sorted
list of numbers. The input data consists of two fields: a single character and an integer value. The
single character gets interpreted as one of the following:
A - represents a value that is to be added to the linked list
D - represents a value to be deleted from the linked list
P - indicates that all values are to be printed in ascending order
R - indicates that all values are to be printed in descending order (use recursion)
The character is only used to determine which process is to be executed; it should not be printed,
entered into the linked list, or processed in any other way. You should use pointers (dynamic
allocation) in this program, no classes, no libraries (STL). The main program should be mainly
function calls. Process input data until end of file. All output should be sent to an output file and
be appropriately formatted and clearly labeled. Keep a running log of everything that is going on
in the processing. Your program should work for any data set.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F936674a8-46b2-4872-b00b-38bd88e95e72%2F6f65a3d5-4146-41fe-b16d-c28128e6e287%2Fbtehpf_processed.png&w=3840&q=75)
Transcribed Image Text:This program will use dynamic allocation to implement a linked list to keep an ascending sorted
list of numbers. The input data consists of two fields: a single character and an integer value. The
single character gets interpreted as one of the following:
A - represents a value that is to be added to the linked list
D - represents a value to be deleted from the linked list
P - indicates that all values are to be printed in ascending order
R - indicates that all values are to be printed in descending order (use recursion)
The character is only used to determine which process is to be executed; it should not be printed,
entered into the linked list, or processed in any other way. You should use pointers (dynamic
allocation) in this program, no classes, no libraries (STL). The main program should be mainly
function calls. Process input data until end of file. All output should be sent to an output file and
be appropriately formatted and clearly labeled. Keep a running log of everything that is going on
in the processing. Your program should work for any data set.
![Input file:
А 54
А-17
А 32
А 81
А -30
А 18
А 41
А 93
А 65
А 80
А 104
R
А-20
D 5
А 79
А 63
А 77
А ?33
P
D 104
D -20
R
D 80
D 32
D 54
P
R](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F936674a8-46b2-4872-b00b-38bd88e95e72%2F6f65a3d5-4146-41fe-b16d-c28128e6e287%2Feowthya_processed.png&w=3840&q=75)
Transcribed Image Text:Input file:
А 54
А-17
А 32
А 81
А -30
А 18
А 41
А 93
А 65
А 80
А 104
R
А-20
D 5
А 79
А 63
А 77
А ?33
P
D 104
D -20
R
D 80
D 32
D 54
P
R
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
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](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education