C++ Code
1. Implement the count_sort() method for count sort in the fileSortable_list.h.
Count sort is a simple algorithm that begins with an unsortedlist and creates a new sorted list. It assumes that all therecords/keys in the original unsorted list are different, i.e.,there are no duplicate keys in the list. For each record in theoriginal list, count sort scans the list once and counts how manyrecords/keys are smaller. For example, if c is the count for arecord r, then the proper location for r in the sorted list isc.
template <class Record>
class Sortable_list:public List<Record> {
public:
// Add prototypes for sorting methods here
void insertion_sort();
void count_sort();
void
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured