[개탱][C언어][하노이탑][간단한 알고리즘][재귀호출][재귀함수][Stack][스택]
·
Dev/알고리즘-자료구조
재귀호출을 사용한 하노이탑123456789101112131415161718192021222324#define _CRT_SECURE_NO_WARNINGS#include #include int n;void hanoi(int n, char from, char tmp, char to);int iNum;int main() { // '1', '2', '3' scanf("%d",&n); printf("%d\n",(int)pow(2,n)-1); hanoi(n,'1','2','3');}void hanoi(int n, char from, char tmp, char to){ if(n==1) { printf("%c %c\n",from,to); iNum++; return; } hanoi(n-1,from,to,tmp); hano..
