![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法学习
ly82882592
这个作者很懒,什么都没留下…
展开
-
汉诺塔c++递归
#include #include int count = 0; void hanio(int n,char A,char B,char C) { if(n == 1) { printf("%d : %c -> %c \n",++count,A,C); } else{ hanio(n-1,A,C,B);原创 2016-03-09 22:58:48 · 763 阅读 · 0 评论 -
二分查找,递归
#include #include int a[10] = {1,2,3,4,5,6,7,8,9,10}; int binarySearch(int left,int right,int key) { int middle = (left+right)/2; if(a[middle] == key) return middle; else if(a[原创 2016-03-10 11:54:10 · 268 阅读 · 0 评论