<h1 id="heading-recurrence-relation">Recurrence Relation</h1>
Definition of Recurrence: Function is calling itself directly or indirectly.
<pre><code class="lang-Python">def fact(n):
 if n==0 or n==1:
 ## o! = 1 and 1! = 1
 return 1
 else:
 return n*fact(n-1)
</code></pre>
There are three type of recurrence relation,
<ul>
<li>Substitution Method</li>
<li>Recursive Tree</li>
<li>Masters Theorem</li>
</ul>
<h2 id="heading-substitution-method">Substitution Method:</h2>
 In this method we will be having only one recursive call.
<h2 id="heading-recursive-tree">Recursive Tree:</h2>
 If we have more than one recursive call in a script then we call it as Recursive Tree method
<h2 id="heading-masters-theorem">Masters Theorem:</h2>
 Actually I missed this class, Surly I will update this as soon as possible

# Recurrence Relation

**Definition of Recurrence: ** Function is calling itself directly or indirectly.

```Python
def fact(n):
  if n==0 or n==1:
    ## o! = 1 and 1! = 1
    return 1
  else:
    return n*fact(n-1)
``` 
There are three type of recurrence relation,
- Substitution Method
- Recursive Tree
- Masters Theorem

## Substitution Method:
  In this method we will be having only one recursive call.

## Recursive Tree:
  If we have more than one recursive call in a script then we call it as Recursive Tree method

## Masters Theorem:
  Actually I missed this class, Surly I will update this as soon as possible





DSA-Recurrence Relation

I will share my thoughts and notes about my studies
