Top "Recurrence" questions

A recurrence relation is an equation that recursively defines a sequence, once one or more initial terms are given: each further term of the sequence is defined as a function of the preceding terms.

Solve the recurrence: T(n)=2T(n/2)+n/logn

I can find the sum of each row (n/log n-i) and also I can draw its recursive tree but …

time complexity-theory recurrence
Reccurrence T(n) = T(n^(1/2)) + 1

I've been looking at this reccurrence and wanted to check if I was taking the right approach. T(n) = T(…

algorithm math big-o analysis recurrence
How to solve: T(n) = T(n/2) + T(n/4) + T(n/8) + (n)

I know how to do recurrence relations for algorithms that only call itself once, but I'm not sure how to …

algorithm recursion recurrence
Recurrence relation: T(n) = T(n/2) + n

Hi there I am trying to solve the following recurrence relation by telescoping but I am stuck on the last …

recurrence
Complexity of the recursion: T(n) = T(n-1) + T(n-2) + C

I want to understand how to arrive at the complexity of the below recurrence relation. T(n) = T(n-1) + T(…

algorithm complexity-theory time-complexity recurrence asymptotic-complexity
Solving a recurrence T(n) = 2T(n/2) + n^4

I am studying using the MIT Courseware and the CLRS book Introduction to Algorithms. I am currently trying to solve …

algorithm math big-o recurrence big-theta
Solving recurrence T(n) = 2T(n/2) + Θ(1) by substitution

So I am pretty sure it is O(n) (but it might not be?), but how do you solve it …

math big-o recurrence
Solving the recurrence T(n) = T(n / 2) + O(1) using the Master Theorem?

I'm trying to solve a recurrence relation to find out the complexity of an algorithm using the Master Theorem and …

algorithm complexity-theory big-o recurrence master-theorem
Calculating the Recurrence Relation T(n)=T(n-1)+logn

We are to solve the recurrence relation through repeating substitution: T(n)=T(n-1)+logn I started the substitution and …

recursion big-o complexity-theory recurrence
Solving the recurrence T(n) = 2T(sqrt(n))

I would like to solve the following recurrence relation: T(n) = 2T(√n); I'm guessing that T(n) = O(log …

algorithm math big-o recurrence