### Algorithm Design & Analysis

Kurskal\'s algo - min cost spanning tree - graphics

### Dynamic Programming Technique

n_th term of fibonacci series - Divide and Conquer

### Exponential Time Algorithms

Prim\'s algo - min Spanning Tree - Mouse support Multiply two matrices

Prim\'s algo to solve Minimum Spanning Tree Problem Binary search algorithm

### Linear Time Algorithms

n_th term of fibonacci series Kurskal\'s - min cost spanning tree - mouse support

### Minimum Cost Spanning Tree Problem

Product of 2 matrices - Divide and Conquer

### Divide and Conquer Strategy

Kurskal\'s algo to solve Minimum Cost Spanning Tree Towers of Hanoi Problem using Recursive Algorithm

### Cubic Time Algorithms

Prim\'s algo solve Minimum Spanning Tree - Graphic Bubble Sort Algorithm

### Logrithmic Time Algorithms

n_th term of fibonacci series - Toplogical Order Compute, display factorial using recursive algo Product of 2 matrices - Strassen\'s Algorithm

# Program to coumputes and displays the factorial of the given number ( using Recursive Algorithm )

``` #include <iostream.h>
#include    <conio.h>

const long factorial(const long);

int main( )
{
clrscr( );

int n;

cout<<\"\\n Enter the number = \";
cin>>n;

cout<<\"\\n n! = \"<<n<<\"!\"<<\"  =  \"<<factorial(n)<<endl;

getch( );
return 0;
}

//--------------------------  factorial( )  -----------------------------//

const long factorial(const long n)
{
long fn=1;

if(n>1)
fn=(n*factorial(n-1));

return fn;
}
```