abstract:In computer science, counting sort is an algorithm for sorting a collection of objects according to keys that are small integers; that is, it is an integer sorting algorithm. It operates by counting the number of objects that have each distinct key value, and using arithmetic on those counts to determine the positions of each key value in the output sequence.
Whereas their neighbours at nearby universities roam their sprawling campuses and prepare for high-powered careers, the Peach Garden children sit 50 to a room at rickety second-hand desks, learning how to read and counting themselves lucky to be in any sort of school at all.