Description: tower of hanoi Description: have a, b, c three塔座. Initially, in塔座on a total of n has a pile of disks, these disks bottom-up, descending to stack together. The disc from small to large number 1,2 ,...., n. Now requested that塔座a disc on the stack to move to塔座b, and is still the same order, stacked. In the mobile disk mobile rules should comply with the following: (1) can only move one disc (2) any time does not permit a larger disc pressure in the smaller disk on top of (3) in meeting the rules (1), (2) under the premise of the disc may be a, b, c 1塔座on any
- [knap1] - 0-1 knapsack problem fringe interface us
- [hanoi] - A Tower of Hanoi procedures, although th
- [Tupo] - Topological sort of the source. This pro
File list (Check if you may need any files):
Download