radixSortAlgo(arr as an array)
Find the largest element in arr
maximum=the element in arr that is the largest
Find the number of digits in maximum
k=the number of digits in maximum
Create buckets of size 0-9 k times
for j -> 0 to k
Acquire the jth place of each element in arr. Here j=0 represents the least significant digit.
Use a stable sorting algorithm like counting sort to sort the elements in arr according to the digits of the elements in the jthplace
arr = sorted elements<br /
python3 -m push_swap_gui