All numbers are assumed to be between 0 and \(k\) . In the pseudocode in Algorith REF , \(C[i]\)  first holds the number of input integers equal to \(i\)  after the second for-loop. Then \(C[i]\)  is modified to hold the number of integers less than or equal to \(i\) , which can be used to place the integers. In the final loop, integers are directly placed in the correct position to the output array \(B\) . \(C[A[j]]\)  is decremented so that the next \(A[j]\)  is placed one position to the left.
 [1]}
<FIGURE>