/*
* 烟台大学计算机与控制工程学院
*作 者:王晓慧
*完成日期:2016年9月8日
*
*问题描述:汉诺塔(详情略)用递归算法求解汉诺塔问题,其复杂度可以求得为O(2的n次方)
*/
#include <stdio.h>
#define discCount 8
#include <time.h>
long move(int, char, char,char);
int main()
{
double t1,t2;
long count;
t1=time(0);
count=move(discCount,'A','B','C');
t2=time(0);
printf("%d个盘子需要移动%ld次\n", discCount, count);
printf("用时 %d 秒!", (int)(t2-t1));
return 0;
}
long move(int n, char A, char B,char C)
{
long c1,c2;
if(n==1)
return 1;
else
{
c1=move(n-1,A,C,B);
c2=move(n-1,B,A,C);
return c1+c2+1;
#include <stdio.h>
#define discCount 8
#include <time.h>
long move(int, char, char,char);
int main()
{
double t1,t2;
long count;
t1=time(0);
count=move(discCount,'A','B','C');
t2=time(0);
printf("%d个盘子需要移动%ld次\n", discCount, count);
printf("用时 %d 秒!", (int)(t2-t1));
return 0;
}
long move(int n, char A, char B,char C)
{
long c1,c2;
if(n==1)
return 1;
else
{
c1=move(n-1,A,C,B);
c2=move(n-1,B,A,C);
return c1+c2+1;
}
}
运行结果
<img src="https://img-blog.csdn.net/20160908213531652?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQv/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center" alt="" />
<img src="https://img-blog.csdn.net/20160908213540259?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQv/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center" alt="" /><img src="https://img-blog.csdn.net/20160908213547056?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQv/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center" alt="" /><img src="https://img-blog.csdn.net/20160908213553275?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQv/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center" alt="" /><img src="https://img-blog.csdn.net/20160908213559371?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQv/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center" alt="" />
知识点总结
复杂度是指数级的算法,随着n的增大,所得结果增大的幅度极大, 所以应该在实际的编程过程中避免这种算法。
学习心得
递归如果能用好的话是非常方便的
<span> </span>