코딩/C, C++, C#
재귀호출 이용한 하노이탑 출력 알고리즘
할맹
2019. 3. 16. 03:26
학교 과제로 했던 알고리즘이다
클린코드 과정을 거치기 전 형태
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 | #include <stdio.h> #include <string.h> void hanoitower(int diskNum, int start, int end); //hanoitower를 만드는 함수(재귀함수 대상인 함수) void hanoishape(int diskNum, int end); //함수 hanoitower가 1번의 재귀를 끝낼 때마다 그때의 디스크 이동을 그림으로 나타내 출력하는 함수 void print_hanoi(); //함수 hanoishape가 만든 모양을 출력하는 함수 struct board { //hanoitower 모양을 만드는 데에 사용되는 구조체(한 줄(disk)씩 만든다) char disk[28]; }; int disks; struct board hanoi[5][1]={" "}; int count=0; void main() { int i; int start, end; while(1) { printf("원판의 개수를 입력하세요(3~5) : "); scanf_s("%d", &disks); printf("출발 기둥과 목적 기둥을 입력하세요(1~3) : "); scanf_s("%d %d", &start, &end); if(!(disks>2 && disks<6 && start>0 && start<4 && end>0 && end<4)) printf("개수를 잘못 입력하셨습니다. 다시 입력해주세요.\n\n"); else break; } printf("Pole %d => Pole %d \n", start, end); for(i=1; i<=3; i++) printf(" Pole %d ", i); printf("\n-------------------------------\n"); switch(start){ case 1:{strcpy_s(hanoi[0][1].disk, " * "); strcpy_s(hanoi[1][1].disk, " *** "); strcpy_s(hanoi[2][1].disk, " ***** "); strcpy_s(hanoi[3][1].disk, " ******* "); strcpy_s(hanoi[4][1].disk, "********* "); } break; case 2:{strcpy_s(hanoi[0][1].disk, " * "); strcpy_s(hanoi[1][1].disk, " *** "); strcpy_s(hanoi[2][1].disk, " ***** "); strcpy_s(hanoi[3][1].disk, " ******* "); strcpy_s(hanoi[4][1].disk, " ********* "); }break; case 3:{strcpy_s(hanoi[0][1].disk, " * "); strcpy_s(hanoi[1][1].disk, " *** "); strcpy_s(hanoi[2][1].disk, " ***** "); strcpy_s(hanoi[3][1].disk, " ******* "); strcpy_s(hanoi[4][1].disk, " *********"); } break; } print_hanoi(); hanoitower(disks, start, end); printf("총 이동횟수 : %d \n", count); } void print_hanoi() { int i; for(i=0; i<disks; i++) { printf("%s", hanoi[i][1].disk); printf("\n"); } printf("-------------------------------\n"); } void hanoitower(int diskNum, int start, int end) { int middle; count++; if(diskNum==1) { hanoishape(1, end); print_hanoi(); } else { middle=6-start-end; hanoitower(diskNum-1, start, middle); hanoishape(diskNum, end); print_hanoi(); hanoitower(diskNum-1, middle, end); } } void hanoishape(int diskNum, int end) { int i; if(diskNum==disks) { //N번째(가장 긴) 디스크를 옮기는 경우 i=disks-1; //배열의 시작인덱스(0) 때문에 1을 뺀다 strcpy_s(hanoi[i][1].disk, " "); switch(disks){ case 3:{ switch(end){ case 1: strcpy_s(hanoi[i][1].disk, " ***** "); break; case 2: strcpy_s(hanoi[i][1].disk, " ***** "); break; case 3: strcpy_s(hanoi[i][1].disk, " ***** "); break; } }break; case 4:{ switch(end){ case 1: strcpy_s(hanoi[i][1].disk, " ******* "); break; case 2: strcpy_s(hanoi[i][1].disk, " ******* "); break; case 3: strcpy_s(hanoi[i][1].disk, " ******* "); break; } }break; case 5:{ switch(end){ case 1: strcpy_s(hanoi[i][1].disk, "********* "); break; case 2: strcpy_s(hanoi[i][1].disk, " ********* "); break; case 3: strcpy_s(hanoi[i][1].disk, " *********"); break; } }break; } } else if(diskNum==disks-1) { i=disks-2; strcpy_s(hanoi[i][1].disk, " "); switch(disks){ case 3:{ switch(end){ case 1: strcpy_s(hanoi[i][1].disk, " *** "); break; case 2: strcpy_s(hanoi[i][1].disk, " *** "); break; case 3: strcpy_s(hanoi[i][1].disk, " *** "); break; } }break; case 4:{ switch(end){ case 1: strcpy_s(hanoi[i][1].disk, " ***** "); break; case 2: strcpy_s(hanoi[i][1].disk, " ***** "); break; case 3: strcpy_s(hanoi[i][1].disk, " ***** "); break; } }break; case 5:{ switch(end){ case 1: strcpy_s(hanoi[i][1].disk, " ******* "); break; case 2: strcpy_s(hanoi[i][1].disk, " ******* "); break; case 3: strcpy_s(hanoi[i][1].disk, " ******* "); break; } }break; } } else if(diskNum==disks-2) { i=disks-3; strcpy_s(hanoi[i][1].disk, " "); switch(disks){ case 3:{ switch(end){ case 1: strcpy_s(hanoi[i][1].disk, " * "); break; case 2: strcpy_s(hanoi[i][1].disk, " * "); break; case 3: strcpy_s(hanoi[i][1].disk, " * "); break; } }break; case 4:{ switch(end){ case 1: strcpy_s(hanoi[i][1].disk, " *** "); break; case 2: strcpy_s(hanoi[i][1].disk, " *** "); break; case 3: strcpy_s(hanoi[i][1].disk, " *** "); break; } }break; case 5:{ switch(end){ case 1: strcpy_s(hanoi[i][1].disk, " ***** "); break; case 2: strcpy_s(hanoi[i][1].disk, " ***** "); break; case 3: strcpy_s(hanoi[i][1].disk, " ***** "); break; } }break; } } else if(disks>=4 && diskNum==disks-3) { i=disks-4; strcpy_s(hanoi[i][1].disk, " "); switch(disks){ case 4:{ switch(end){ case 1: strcpy_s(hanoi[i][1].disk, " * "); break; case 2: strcpy_s(hanoi[i][1].disk, " * "); break; case 3: strcpy_s(hanoi[i][1].disk, " * "); break; } }break; case 5:{ switch(end){ case 1: strcpy_s(hanoi[i][1].disk, " *** "); break; case 2: strcpy_s(hanoi[i][1].disk, " *** "); break; case 3: strcpy_s(hanoi[i][1].disk, " *** "); break; } }break; } } else { i=disks-5; strcpy_s(hanoi[i][1].disk, " "); switch(end){ case 1: strcpy_s(hanoi[i][1].disk, " * "); break; case 2: strcpy_s(hanoi[i][1].disk, " * "); break; case 3: strcpy_s(hanoi[i][1].disk, " * "); break; } } } | cs |
<실행 결과>
