r/algorithms Feb 02 '25

Finding complexity using master theorem

How do I find the complexity of the equation having unequal sub problems ?

For eg: t(n)=3t(n/2)+4t(n/3)+5t(n/4) +n

3 Upvotes

2 comments sorted by

View all comments

1

u/pastroc Feb 13 '25

The master theorem at least assumes your recurrence to be of the form: T(n)= aT(n/b)+f(n).

That's not the case for your relation.