suppose i have 6 numbers 379,635,274,743,980,835
i read that radix sort runs in O(d(n+k)) time. where d-number of digits
,n=6,k=each digit range.
But after the elements are sorted on LSB ,to find next digit we need to
perform / and % operation
379 /10 = 37 and 37 %10= 7
so it is taking O(d)
Can somebody explain why we have to shift the base of numbers while
doing Radix Sort.
I have read that if we have to sort N numbers we should convert all of
them to base N...
wats the use of it and while converting them wont it effect the time
complexity
--
You received this message because y
