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
Half-integer the double factorial. Half-integer In mathematics, a half-integer is a number of the form where formula_2 is an integer. For example, are all half-integers. Half-integers occur frequently enough in mathematical contexts that a special term for them is convenient. Note that a half of an integer is not always a half-integer: half of an even integer is an integer but not a half-integer. The half-integers are precisely those numbers that are half of an odd integer, and for this reason are also called the half-odd-integers. Half-integers are a special case of the dyadic rationals, numbers that can be formed by