Here are the code and output, can you please help me answer the two questions? code： #include #include using namespace std; // tower of HANOI function implementation void moveDisk(int n, char Original, char Aux, char Dest) { if(n == 0) return; moveDisk(n-1, Original, Dest, Aux); cout << "Move Disk " << n << " from " << Original << " to " << Dest << endl; moveDisk(n-1, Aux, Original, Dest); } // main program int main() { int n; time_t start, end; cout << "Enter the number of disks:"; cin >> n; // calling the moveDisk time (&start); moveDisk(n, 'A', 'B', 'C'); time (&end); double elapse = difftime (end, start); cout << "The elapsed time is " << elapse << " seconds" << " for moving " << n << " disks " << endl; return 0; } output： 1.How many seconds does the server spend on 16 disks? 2. How many disks can successfully move from A to C, in 24-hour?(please list a brief calculation)
Here are the code and output, can you please help me answer the two questions?
code：
#include<iostream>
#include<time.h>
using namespace std;
// tower of HANOI function implementation
void moveDisk(int n, char Original, char Aux, char Dest)
{
if(n == 0)
return;
moveDisk(n-1, Original, Dest, Aux);
cout << "Move Disk " << n << " from " << Original << " to " << Dest << endl;
moveDisk(n-1, Aux, Original, Dest);
}
// main program
int main()
{
int n;
time_t start, end;
cout << "Enter the number of disks:";
cin >> n;
// calling the moveDisk
time (&start);
moveDisk(n, 'A', 'B', 'C');
time (&end);
double elapse = difftime (end, start);
cout << "The elapsed time is " << elapse << " seconds" << " for moving " << n << " disks " << endl;
return 0;
}
output：
1.How many seconds does the server spend on 16 disks?
2. How many disks can successfully move from A to C, in 24-hour?(please list a brief calculation)
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
