汉罗塔问题的递归和迭代算法

#include<stdio.h>//递归实现 int hnt_recursion(int index){if(index == 1||index ==2)return 1;elsereturn hnt_recursion(index-1) + hnt_recursion(index-2);}//迭代实现int hnt_iteration(int index){if(index == 1 || index == 2)return 1;else{int a=1,b=1,c=0; for(int i=3;i<=index;i++){c=a+b;a = b;b = c; }return c;}}int main(){int result;result = hnt_recursion(7);printf("%dn",result);result = hnt_iteration(7);printf("%dn",result);return 0;}