In recording scores for a golf tournament, we enter the name and score of the player as the player finishes. This information is to be retrieved in each of the following ways: Scores and names can be printed in order by ascending or by descending scores. Given the name of a player, other players with the same score can be printed. For that, we have to design a structure that keeps the information in a way that each player has information of the player next to it and the one behind it as well. Implement the above scenario using a doubly-linked list of data structure and also classes and encapsulation method in C++ Programming. Your Application should do the following: Add new Player ( it should insert values in sorted order) Delete a player ( user enters the name of a player to be deleted) Display: Whole list (all players with their scores) Display player with lowest scores in the list. Display all those players having the same score entered by the user. Display Backward From a player ( it should print data of all the players behind a player)

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

In recording scores for a golf tournament, we enter the name and score of the player as the player finishes. This information is to be retrieved in each of the following ways:

Scores and names can be printed in order by ascending or by descending scores.
Given the name of a player, other players with the same score can be printed.
For that, we have to design a structure that keeps the information in a way that each player has information of the player next to it and the one behind it as well.

Implement the above scenario using a doubly-linked list of data structure and also classes and encapsulation method in C++ Programming.

Your Application should do the following:

Add new Player ( it should insert values in sorted order)
Delete a player ( user enters the name of a player to be deleted)
Display:
Whole list (all players with their scores)
Display player with lowest scores in the list.
Display all those players having the same score entered by the user.
Display Backward From a player ( it should print data of all the players behind a player)

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY