Tower Of Hanoi

• Tweet
• 

        Solves the old "Tower of Hanoi" problem using a recursive divide et impera approach.

http://en.wikipedia.org/wiki/Tower_of_Hanoi

#include <stdio.h>

void hanoi(int n, char a, char b, char c) {
	if (!n)	
		return;
	
	hanoi(n - 1, a, c, b);
	printf("%c -> %c\n", a, b);
	hanoi(n - 1, c, b, a);
}

int main(int argc, char *argv[]) {
	int n = 3;
	hanoi(n, 'a', 'b', 'c');
	
	return 0;
}

Tags:
• C
• divide et impera
• recursive