### 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 n_th term of fibonacci series

### Minimum Cost Spanning Tree Problem

Kurskal\'s - min cost spanning tree - mouse support 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 Prim\'s algo solve Minimum Spanning Tree - Graphic

### Cubic Time Algorithms

Bubble Sort Algorithm n_th term of fibonacci series - Toplogical Order

### Logrithmic Time Algorithms

Compute, display factorial using recursive algo Product of 2 matrices - Strassen\'s Algorithm

### Dynamic Programming Technique

Kurskal\'s algo - min cost spanning tree - graphics n_th term of fibonacci series - Divide and Conquer

# Program to solve the Towers of Hanoi Problem (using Recursive Algorithm)

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

void move(const int n,const int fromTower,
const int toTower,const int spareTower)
{
if(n>0)
{
move((n-1),fromTower,spareTower,toTower);

cout<<\"\\t Move the Top Disk from Tower-\"<<fromTower
<<\" to Tower-\"<<toTower<<\"\\n\";

move((n-1),spareTower,toTower,fromTower);
}
}

int main( )
{
clrscr( );

cout<<\"\\n\\t **************   TOWERS OF HANOI   **************\\n\"<<endl;
cout<<\"\\t The Mystery of Towers of Hanoi is as follows : \\n\"<<endl;

move(4,1,3,2);

cout<<\"\\n\\t *************************************************\";

getch( );
return 0;
}
```

Didn't find what you were looking for? Find more on Program to solve the Towers of Hanoi Problem (using Recursive Algorithm)