Answer to Question #291298 in C++ for hajar

Question

-         Design a C++ program that solves Hanoi towers problem

-         Experiment with your program , using n=3, n=10, n=20, n=60; and register the number of disk moves required for Hanoi towers problem solution for each value of n and approximate run times.

-         Trace execution of your algorithm for n=3 by making a tree of function calls.

-         What is the time-efficiency class of your algorithm?

Answer 1

Dear hajar, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order