15,033,111 members
1.00/5 (1 vote)
See more:
Why the time complexity of radix sort is T(n) = O(d*(n+b)) ?

where
d is the number of digits in the given list
n is the number of elements in the list
b is the base or bucket size used, which is normally base 10 for decimal
representation.

I did not understand why b is included here ?

When I calculated time complexity of radix sort , i am getting like this:
O(d*(n))

What I have tried:

I did not understand why b is included here ?
Posted
Updated 30-Jul-21 18:34pm

## Solution 1

Have a look here: Radix Sort - GeeksforGeeks[^]
_-_-_-me 31-Jul-21 2:05am

But , why b is included ?
OriginalGriff 31-Jul-21 3:33am

Why do you think it is?
Think about it another way: what would happen if it wasn't?

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Top Experts
Last 24hrsThis month
 Dave Kreskowiak 170 OriginalGriff 150 Rick York 145 Joe Woodbury 100 Richard Deeming 75
 OriginalGriff 2,627 Richard Deeming 1,638 Richard MacCutchan 1,437 CPallini 913 Dave Kreskowiak 696

CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900