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.
C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter17: Linked Lists
Section: Chapter Questions
Problem 18SA
Related questions
Question
Got stuck on this problem, please help!
Expert Solution
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
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
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning