Algorithm Implementation/Sorting/Radix sort

Radix Sort
Radix Sort is a sorting algorithm designed to work on items where the key of each item is an ordered set of integers in the range 0 to (N-1) inclusive both ends, or can be transformed into such an ordered set.

C# least significant digit (LSD) radix sort implementation
Here we sort an unsigned integer array that's passed to the RadixSort method (Note: all arrays in C#/.NET are reference types, and therefore a is a reference to an array).

Source: article on www.osix.net (here)

Python LSD radix sort
Implementazioni di algoritmi/Radix sort