CODEWITHSUNDEEP
algorithmmaster-theorem
user597861
user597861

Reputation: 91

Using the master theorem

Use the master theorem to put O() bounds on this statement:

T(n) = 16T(n/4) + n2 + log n

Upvotes: -1

Views: 1236

Answers (2)

erfan30
erfan30

Reputation: 105

T(n)=16T(n/4)+n^2+log n ==> T(n)=16T(n/4)+n^2. Because n^lg16=n^2 the result is o(n^2 log n)

Upvotes: 0

user467871
user467871

Reputation:

I think this resource is enough for this question

Upvotes: 2

Related Questions