Question

Recursion Write a program to solve the Towers of Hanoi problem for a tower of size n, using both recursion and iteration. Time each method separately. Be very carefull to time only the actual work and avoid superfluous module calls and initialization, etc. Compare and contrast your two versions of the problem. Are they what you expected? Your analysis must contain a table of the times obtained for each run. For a tower of a particular size, your output should consist of a list of moves that must be made as well as the times obtained. Disk 1 is always the top disk. Print your output to a file, not the screen. E.g. for a tower of size two Move disk 1 from tower A to tower C Move disk 2 from tower A to tower B Move disk 1 from tower C to tower B Run each version for the values n=1,2,3...50 or until you time out.

Answer 1

`Hey,

Note: If you have any queries related the answer please do comment. I would be very happy to resolve all your queries.

public class Test
{
// Java recursive function to solve tower of hanoi puzzle
static void towerOfHanoi(int n, char from_rod, char to_rod, char aux_rod)
{
if (n == 1)
{
System.out.println("Move disk 1 from tower " + from_rod + " to tower " + to_rod);
return;
}
towerOfHanoi(n-1, from_rod, aux_rod, to_rod);
System.out.println("Move disk " + n + " from tower " + from_rod + " to tower " + to_rod);
towerOfHanoi(n-1, aux_rod, to_rod, from_rod);
}
  
// Driver method
public static void main(String args[])
{
int n = 4; // Number of disks
towerOfHanoi(n, 'A', 'C', 'B'); // A, B and C are names of rods
}
}

M Inbox - gurkar (1) Input Funci | Computer Scie * <> Online Java Co My Q&A | Che X Kaun Nachdi ( x + - 0 % f = C tutorialspoint.com/compile_java_online.php Cocodingground Compile and Execute Java Online (JDK 1.8.0) Fork & Project Edit Setting - Login STDIN I.l. Result ==C Execute > Share Source File 1 public class Test // Java recursive function to solve tower of hanoi puzzle static void towerOfHanoi(int n, char from_rod, char to rod, char aux_rod) { if (n == 1) + from_rod + " to System.out.println("Move disk 1 from tower tower " + to_rod); return; $javac Test.java $java -Xmx128M -Xms16M Test Move disk 1 from tower A to tower B Move disk 2 from tower A to tower C Move disk 1 from tower B to tower C Move disk 3 from tower A to tower B Move disk 1 from tower C to tower A Move disk 2 from tower C to tower B Move disk 1 from tower A to tower B Move disk 4 from tower A to tower C Move disk 1 from tower B to tower C Move disk 2 from tower B to tower A Move disk 1 from tower C to tower A Move disk 3 from tower B to tower C Move disk 1 from tower A to tower B Move disk 2 from tower A to tower C Move disk 1 from tower B to tower C + from rod + " to towerofHanoi(n-1, from rod, aux rod, to rod): System.out.println("Move disk " + n + " from tower tower " + torod); towerofHanoi(n-1, aux_rod, to_rod, from rod); // Driver method public static void main(String args[]) int n = 4; // Number of disks towerofHanoi(n,'A', 'C', 'B'); 20 / A, B and C are names of rods 1 Type here to search R a dy ENG 12:58 AM IN 03/09/20 F

Time complexity is O(2^n)

Space needed is O(n) on the stack

Kindly revert for any queries

Thanks.