Calculating the Time complexity using Radix sort Im trying to determine what is the time complexity of sorting numbers with a specific range and base.
I have n numbers in the range of 1-n^10 and the base for the radix sort is n/log n.
I have tried to calculate it using log equations but im getting to a linear result, I dont know wether im right or wrong.
Thank you very much.
You are correct.  We have $(n/\log n)^{20} \le n^{10}$ for all $n\ge 1$, so each number can be expressed using at most $d=20$ &quot;digits&quot;.  The running time of radix sort is $O(dn)$, and $O(20n)$ is $O(n)$, so the running time is linear in $n$.