The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
11 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$
asked in Algorithms by Boss (41k points)
edited by | 11 views

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
49,814 questions
54,521 answers
188,389 comments
75,430 users