Counting sort initialization of the output array, each take time. Therefore, the time for the whole algorithm is the sum of the times for these steps, . Because it uses arrays of length and , the total space usage of the algorithm is also . For problem instances in which the maximum key value is significantly smaller than the number of items, counting sort can be highly space-efficient, as the only storage it uses other than its input and output arrays is the Count array which uses space . If each item to be sorted is itself an integer, and used as
Arithmetic number Arithmetic number In number theory, an arithmetic number is an integer for which the average of its positive divisors is also an integer. For instance, 6 is an arithmetic number because the average of its divisors is which is also an integer. However, 2 is not an arithmetic number because its only divisors are 1 and 2, and their average 3/2 is not an integer. The first numbers in the sequence of arithmetic numbers are It is known that the natural density of such numbers is 1: indeed, the proportion of numbers less than "X" which are not arithmetic is