Time complexity of radix sort

Question

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 30-Jul-21 17:56pm

_-_-_-me

Updated 30-Jul-21 18:34pm

Add a Solution

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

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

OriginalGriff · Answer 1 · 2021-07-30T18:34:00

Solution 1

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

Posted 30-Jul-21 18:34pm

OriginalGriff

Comments

_-_-_-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?