검색어 입력폼

[자료구조 C&#5061] 하노이 탑

등록일 2004.03.29 파일확장자압축파일 (zip) | 3페이지 | 가격 500원

소개글

하노이탑 소스

레포트 - 스크린샷, 알고리즘 설명
(영문)

목차

<파일목록>
20031066_hw#3.c
20031066_hw#3.doc
20031066_hw#3.exe
cygwin1.dll
readme.txt

본문내용

Data Structure
HW#3



꺶 Program functionality
This program solves the problem of the Tower of Hanoi. This shows the movements of disks.


꺶 Program design
Suppose there are three disks. According to the rule of the Tower of Hanoi, we need to move the disks from A to B and then from A to C then from B to C. At here, how can we move all disks from A to B? It is same problem. At first, move the disks from A to C then from A to B then from C to B. It is recursion. Moreover, the integer value indicates a depth of the movement.
다운로드 맨위로