Skip to main content
Computer Science

Return to Question

Tweeted twitter.com/StackCompSci/status/978825624717549568
deleted 15 characters in body; edited tags; edited title
Source Link
Yuval Filmus
Yuval Filmus
  • 280.9k
  • 27
  • 319
  • 516

How to solve a recurrancerecurrence relation of the following formwith a sum?

enter image description here How do I solve the following recurrence relation?

$$ T(n) = 1 + \sum_{j=0}^{n-1} T(j). $$

I thought of solving it by generating its recursion tree. I found that the height of the tree would be equal to n$n$ but wasn't able to find the cost of each level.

Anyone please help :)

How to solve a recurrance relation of the following form?

enter image description here

I thought of solving it by generating its recursion tree. I found that the height of the tree would be equal to n but wasn't able to find the cost of each level.

Anyone please help :)

How to solve a recurrence relation with a sum?

How do I solve the following recurrence relation?

$$ T(n) = 1 + \sum_{j=0}^{n-1} T(j). $$

I thought of solving it by generating its recursion tree. I found that the height of the tree would be equal to $n$ but wasn't able to find the cost of each level.

Source Link
Navjot Singh
Navjot Singh
  • 1.2k
  • 1
  • 9
  • 26

How to solve a recurrance relation of the following form?

enter image description here

I thought of solving it by generating its recursion tree. I found that the height of the tree would be equal to n but wasn't able to find the cost of each level.

Anyone please help :)