Description: Tower of Hanoi algorithm: the above n-1 a plate moves from A to C, B as an auxiliary n the bottom of the plate moves from A to B, the n-1 a plate moving from C to B, A as an auxiliary 1 for an integer array design a sorting algorithm. n-element real array elements to write seeking the maximum and minimum elements of the algorithm
To Search:
File list (Check if you may need any files):
homework1.cpp
homework4.cpp
homework5.cpp
Download