The Gateway to Computer Science Excellence
0 votes
20 views

Use the master method to give tight asymptotic bounds for the following recurrences.

  1. $T(n)=2T(n/4) + 1$
  2. $T(n)=2T(n/4) +\sqrt{n}$
  3. $T(n)=2T(n/4) +n$
  4. $T(n)=2T(n/4) +n^2$
in Algorithms by Boss (41.7k points)
edited by | 20 views
0
1. $\Theta$(√ n)

2.$\Theta (√ n)logn$

3.$\Theta (n)$

4.$\Theta (n^2)$

please verify it.

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,666 questions
56,167 answers
193,838 comments
94,018 users