1.1 the purpose and requirements of the experiment The design data structure represents 3 pagodas and N plates. The case of each moving dish. Analysis of the time performance of the algorithm 1.2 experimental design 1; the N-1 plates on the tower A are moved to the tower B with the aid of the tower C 2: move one of the remaining plates on the tower A to the tower C 3: n-1 B A with the dish from the tower tower to tower C Three pagodas (tower A, tower B, pagoda C), respectively, three character variables A, B, and C, respectively, indicate that the N plates are numbered from 1 to the natural number.

Filename	Size	Update
数据结构-汉诺塔-实验报告.doc	49152	2017-12-13

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．