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
Lelong number number ν("A","x") is the limit of the ratio of the areas of "A" ∩ "B"("r","x") and a ball of radius "r" in C as the radius tends to zero. (Here "B"("r","x") is a ball of radius "r" centered at "x".) In other words the Lelong number is a sort of measure of the local density of "A" near "x". If "x" is not in the subvariety "A" the Lelong number is 0, and if "x" is a regular point the Lelong number is 1. It can be proved that the Lelong number ν("A","x") is always an integer. Lelong number In