Recursion a. Write a recursive algorithm for the Towers of Hanoi problem in pseu

Question

Recursion

a. Write a recursive algorithm for the Towers of Hanoi problem in pseudocode. Assume that there are n disks with diameters 1 cm, 2 cm, 3 cm, … , n cm (from top disk to bottom disk). They need to be moved from peg A to peg B using peg C as a buffer. Only one top disk can be moved at a time from one peg to another; a bigger disk should never be placed above a smaller disk.

b. Prove that the number of disk moves is 2n -1 using the method of Mathematical Induction. It should be based on your pseudocode, and all three steps of Mathematical Induction should be shown.

Explanation / Answer

Answer is as follows:

According to Chegg's Policy, I will provide the answer of question 1, So please repost others..

Answer of a)

Pseudo code of Tower of Hanoi with recursive technique :

If there are n disks than than we can solve this in 2n - 1 moves.

/* ...*/ lines are comments...

if there is any query or you want part b that let me know in comments...

Related Questions

Navigate

• Browse (All)
• Browse R
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.