|
#include<stdio.h>
void MoveDisk(int,char,char,char);
int main(void){
int n;
printf("Input Disk Number >> ");
scanf("%d",&n);
// MoveDisk로 n값과 x,y,z 문자를 넘긴다.
MoveDisk(n,'x','y','z');
return 0;
} 4주 - Recursion
|
|
|
|
%d,%d= %ld\n",m, n, result);
printf("Duration: %4.3f micro sec.\n\n",
(double)(endTime.QuadPart-startTime.QuadPart)/freq.QuadPart*1000000);
}
else printf("This computer don't support QueryPerformanceCounter Set\n");
} 3주 - Basic Recursion
|
|
|
인하대 데이터구조 3주차 Homework01 하노이의 탑
목차
1. Please create a program that shows the implement of Hanoi tower by using the recursion.
2. Calculate the time complexity.
3. If 64 disks are in Hanoi Tower, How many times should I move disks?
1. Please create a program that sh
|
|
|
|
Recursion
4주 - Recursion
5주 - Sorting Performance analysis
6주 - Exercising Array
7주 - Evaluation of Expression
8주 - Circular Queue & Maze
9주 - Stack & Queue using Linked list
10주 - Equivalenece Class
11주 - Binary Search Tree
12주 - Priority Queue
13주 - Selection Tree
14주 - Union
|
|
|
|
Recursion
4주 - Recursion
5주 - Sorting Performance analysis
6주 - Exercising Array
7주 - Evaluation of Expression
8주 - Circular Queue & Maze
9주 - Stack & Queue using Linked list
10주 - Equivalenece Class
11주 - Binary Search Tree
12주 - Priority Queue
13주 - Selection Tree
14주 - Union
|
|
메뉴펼치기
