Basic pseudo code into real code java (with small modifications).

I have the following 2 pieces of pseudo code, and want to implement them in java to create a working LSD radix sort, counting sort pair.

Although the pseudo code is 1-indexed please transform into 0-indexed

LSDRadixSort(Array A, 1-indexed) { d - numDigits in largest number in A for i = 1 to d stable sort (bucket, or counting sort) A on i right-most digit countingSort(Array A, 1-indexed) { k = largest int in A C = Array of k+1 zeros, 0-indexed for x in A C[x] = C[x] + 1 // C[i] = num elements equal to i for 1 to k C[i] = C[i] + C[i-1] // cumulative array B = Output Array, same length as A for j = A.length -> 1 B[C[A[j]]] = A[j] C[A[j]] = C[A[j]]-1