Radix sort

Time complexity
O (d(n+b))
Where d = the number of digits, n = length of the array and b = the base for
.representing numbers

The best case

.The best case occurs when all elements have the same number of digits
.If b = O(n), then time complexity is O(dn)  

The worst case

The worst case in radix sort occurs when all elements have the same number of
.digits except one element which has larger number of digits
If the number of digits in the largest element is equal to n, then the runtime
.becomes O(n2)