Radix Gnome Sort - Sorting algorithm visualization using SortTheater

Radix Gnome Sort is a variation of Optimized Gnome Sort, that works by sorting one digit at a time.

Time complexity:
Best case= O(d*n)
Average/worst case= O(d*n^2)
Space complexity: O(1)
"d" stands for the quantity of digits of the maximum number