文件名称:zuoye
介绍说明－－下载内容均来自于网络，请自行研究使用
汉诺塔 算法：将上面的n-1个盘子从A移动到C，B作为辅助；
将最下面的盘子n从A移动到B，
将n-1个盘子从C移动到B，A作为辅助
1. 对一个整形数组设计一个排序算法
.n个元素的实数数组，写出求其最大元素和最小元素的算法-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
将最下面的盘子n从A移动到B，
将n-1个盘子从C移动到B，A作为辅助
1. 对一个整形数组设计一个排序算法
.n个元素的实数数组，写出求其最大元素和最小元素的算法-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
(系统自动生成,下载前可以参看下载内容)
下载文件列表
homework1.cpp
homework4.cpp
homework5.cpp
homework4.cpp
homework5.cpp