Recursion
greatbear_us
这个作者很懒,什么都没留下…
展开
-
pow function
Signiture: int pow(int, int); int myPow(int x, int n){ if(n == 1) return x; return x * myPow(x, n-1); } Exponentiation by squaring is a more efficient way.原创 2013-05-12 01:27:50 · 419 阅读 · 0 评论 -
Tower of Hanoi
#include #include void towerOfHanoi(int n, char from, char to, char temp); int main() { towerOfHanoi(5,'A','C','B'); return 0; } void towerOfHanoi(int n, char from, char to, char temp){原创 2013-05-12 12:54:45 · 347 阅读 · 0 评论 -
Fibonacci Numbers
#include #include int fabonicciRecursive(int); int fabonicci(int); int main() { int rs = fabonicci(5); int rs2 = fabonicciRecursive(5); printf("%d\n", rs); printf("%d\n", rs2);原创 2013-05-11 09:51:16 · 340 阅读 · 0 评论