15,072,938 members

See more:

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.

When I calculated time complexity of radix sort , i am getting like this:

I did not understand why b is included here ?

Have a look here: Radix Sort - GeeksforGeeks[^]

Comments

But , why b is included ?

Why do you think it is?

Think about it another way: what would happen if it wasn't?

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)

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