You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
notes/classes/algorithms/solving_recurrence_relation...

328 B

Solving recurrence relations

from algorithms

Forward or backward substitution is the most common way to solve recurrence relations, where you solve it with a number of known values that allow you to use the starting condition.

see also

list without id file.inlinks
where file.name = this.file.name