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/recurrence_relations.md

593 B

Recurrence Relations

from algorithms

recurrence relations are a mathmatical and computational way to express the nth iteration in terms of the preceding terms (represented as k).

$$ f(n) = n*f(n-1) $$ is the definition for the function of a factorial $$ f(n) = n! $$ in algorithms, this is used to analyze recursive algorithms, because expressing an iteration in terms of it's solutions to smaller problems help to provide a explicit formula for the algorithm.

see also

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