"""
Template for Radix Sort
Copyright 2018, University of Freiburg.
Philipp Schneider
"""
from CountingSort import countingsort_stable, element
def radixsort(a):
"""
Sorts an array of integers. Relies on a stable sorting meachnism.
The basic idea is to repeatedly sort the integers by their i-th digits.
Sorting criteria in i-th iteration of sorting are the i-th digits
of the integers in input array 'a' considered in n-adic represenation.
A positive integer in n-adic representation is given to the base
or 'radix' n: z = a0 n^0 + a1 + n^1 + ...
Argument type:
int[]
Return type:
int[]
"""