336x280(권장), 300x250(권장), 250x250, 200x200 크기의 광고 코드만 넣을 수 있습니다.
////////////////////////////////////////////////////////////////////////////////
// Title : 하노이탑
// Author : 최민혁
// Revision : 2006. 9. 29 First implementation
////////////////////////////////////////////////////////////////////////////////
#include <stdio.h>
const int MAX = 3;
void hanoi( int n, char from, char temp, char to );
int main( void )
{
char a = 'A';
char b = 'B';
char c = 'C';
hanoi( MAX, a, b, c );
return 0;
}
void hanoi( int n, char from, char temp, char to )
{
if ( n == 1 )
printf( "%c -> %c\n", from, to );
else
{
hanoi( n - 1, from, to, temp );
printf( "%c -> %c\n", from, to );
hanoi( n - 1, temp, from, to );
}
}
'Programming > Algorithm' 카테고리의 다른 글
Magic Square (0) | 2015.02.07 |
---|---|
Linked List Calculator (0) | 2015.02.07 |
Fibonacci Search (0) | 2015.02.07 |
Euclid (0) | 2015.02.07 |
Double Linked List (0) | 2015.02.07 |