1procedure countingSort(A)
2 k ← max(A)
3 create count[0..k] = 0
4 for each element x in A do
5 count[x] ← count[x] + 1
6 for i ← 1 to k do
7 count[i] ← count[i] + count[i-1]
8 for j ← n-1 downto 0 do
9 output[count[A[j]] - 1] ← A[j]
10 count[A[j]] ← count[A[j]] - 1
11 return output