Question: Hello, Can someone help me with this problem. # Write a class called Song in a file called Song.h with three fields: Title (string) Singer
Hello,
Can someone help me with this problem.
# Write a class called Song in a file called Song.h with three fields:
Title (string)
Singer (string)
Chart Position (int)
# Place these method headers in the Song.h file
1. Getter and setter for each field
2. Other methods
1. Song(); // default constructor
2. Song(std::string title,std:: string singer, int chartPosition); // custom constructor
3. std::string toString(); // returns object as a string
4. bool operator<(Song other) // overloads the < operator -returns true if the chart position of this song is less others
5. friend std::ostream & operator<<(std::ostream&, Song* s); // overloads the << operator
# Write the implementation of these methods in a file called Song.cpp
# Write a driver called SongMain.cpp that does the following
a. Creates a dynamic array that reads in data from SongData.txt and
b. Populates the array by constructing song objects from this data
c. Uses the non-recursive selection sort method to sort the array according to chart position (uses the overloaded < operator on Song objects)
d. Prints the top ten songs in the chart (uses the overloaded << operator)
e. Searches for any song by title and returns chart position asks user for song title, does linear search returns position or -1
Todo List:
Use the templates given to you. You are given starter code for Song.h, Song.cpp and SongMain.cpp
Code marked GIVEN CODE is given to you for free Comments marked //TODO indicated you need to fill in code.
These templates are a guide and you may tweak them if needed
Run and test the project for edge cases, average and load cases
Run the program with the data file SongsData.txt. This file contains 100 song entries. Save the output
Run the program one more time with the data file SongsDataDouble.txt. This has an additional 100 song entries. Save the output
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
