Question

Hanoi Tower Recursion Implementing with Vector (stack) c++

To implement the Hanoi Tower using the following Stack operation provided by STL Vector:

• push_back()
• pop_back()
• back()

Sample Test Run

Enter hanoi tower height: 4
src: 4 3 2 1  | dest:  | temp: 
src: 4 3 2  | dest:  | temp: 1 
src: 4 3  | dest: 2  | temp: 1 
src: 4 3  | dest: 2 1  | temp: 
src: 4  | dest: 2 1  | temp: 3 
src: 4 1  | dest: 2  | temp: 3 
src: 4 1  | dest:  | temp: 3 2 
src: 4  | dest:  | temp: 3 2 1 
src:  | dest: 4  | temp: 3 2 1 
src:  | dest: 4 1  | temp: 3 2 
src: 2  | dest: 4 1  | temp: 3 
src: 2 1  | dest: 4  | temp: 3 
src: 2 1  | dest: 4 3  | temp: 
src: 2  | dest: 4 3  | temp: 1 
src:  | dest: 4 3 2  | temp: 1 
src:  | dest: 4 3 2 1  | temp: 

 --- exit!                                                                                   
   

Submit

1. HanoiTowerVector.cpp
2. Validation (screenshot) of your test run of the program
3. a picture of the Lab10C illustration of 3 disks Hanoi Tower and show the relationship between H(3) and 2xH(2) and relationship between them.

Answer 1

here is required program:

#include <bits/stdc++.h>
using namespace std;
std::vector<int> a;
std::vector<int> b;
std::vector<int> c;
int pop(int t) //pop from the vector
{
int n;
switch(t){
case 1:n=a.back();a.pop_back();return n;
case 2:n=b.back();b.pop_back();return n;
case 3: n=c.back(); c.pop_back();return n;
}
return 0;
}
void push(int t,int n) //push into the vector
{
switch(t){
case 1: a.push_back(n);break;
case 2:b.push_back(n);break;
case 3: c.push_back(n);break;
}
}
void display() //display utility function
{
std::vector<int> ::iterator it;
cout<<"src: ";
for(it=a.begin();it!=a.end();it++)
{
cout<<*it<<" ";
}
cout<<" | dest:";
for(it=c.begin();it!=c.end();it++)
{
cout<<*it<<" ";
}
cout<<" | temp:";
for(it=b.begin();it!=b.end();it++)
{
cout<<*it<<" ";
}
cout<<"\n";

}
void towerOfHanoi(int n, int from_rod,
int to_rod, int aux_rod)
{
if (n == 1)
{
  
push(to_rod,pop(from_rod));
display();
return;
}
towerOfHanoi(n - 1, from_rod, aux_rod, to_rod);
push(to_rod,pop(from_rod));
display();
towerOfHanoi(n - 1, aux_rod, to_rod, from_rod);
}
  
// Driver code
int main()
{
int n = 4; // Number of disks
a.push_back(4);
a.push_back(3);
a.push_back(2);
a.push_back(1);
display();
towerOfHanoi(n, 1, 3, 2); //1,2,3 indicates which vector is pointed
return 0;
}

here is ss of output:

I hope this will help you so please give positive ratings :)))