write a c++ code

Count sort is a simple algorithm that begins with an unsorted list and creates a new sorted list. It assumes that all the records/keys in the original unsorted list are different, i.e., there are no duplicate keys in the list. For each record in the original list, count sort scans the list once and counts how many records/keys are smaller. For example, if c is the count for a record r, then the proper location for r in the sorted list is c