搜索资源列表
1915
- poj1915求移动棋子到特定位置的最少次数,BFS经典题目-poj1915 for mobile pawn to a specific location of the minimum number, BFS Classic Title
Han_nuota
- 汉诺塔小程序的源代码 输入盘中个数后，给出移动步骤-Tower of Hanoi applet source code after the number of input, the given mobile steps
hanoi
- 一个关于汉诺仪塔的算法，能够显示出具体的每个盘的移动步骤，还有经过了多少步骤的次数。-Hannuoba instrument on the tower algorithm, be able to show that each specific set of mobile steps to have the number after the number of steps.
TowerofHanoi
- 输入汉诺塔的总阶数，就可以显示汉诺塔的移动步骤，即每一步的移动，最后显示移动的总次数-Enter the Tower of Hanoi s total order, we can show the movement of Hanoi Tower, that is, to every step of the movement, and finally show the total number of mobile
Internal-comparison-algorithm
- 系统用srand()函数产生一个以当前时间开始的随机种子。其产生的种子用选择排序、冒泡排序、快速排序将顺序表中的数字排好，设置变量记录每种排序关键字的移动次数和关键字的比较次数。选择排序：利用L.length-1个循环，将随机种子按从小到大的顺序排好。-System with srand () function generates a random seed to start the current time. Which produces seeds with selection sort,