suanfa
所属分类:数据结构
开发工具:Java
文件大小:5KB
下载次数:4
上传日期:2009-02-24 22:53:14
上 传 者:
www16niucom
说明: 算法设计与分析
1. 用直接递归方法计算n!:
(2)通过键盘输入n的值,(
2. 用直接递归方法计算第n个Fibonacci数:
3. 用直接递归方法计算Ackerman函数:
4. 用直接递归方法给出n个元素的全排列:
8. 用直接递归方法求解Hanoi塔问题
(Algorithm Design and Analysis 1. Using direct recursive method n! : [2] through the keyboard input value n, [2. Using direct recursive calculation of the first n Ways个Fibonacci number: 3. Using direct recursive method Ackerman function: 4. Ways give direct recursive elements n full-order: 8. using direct recursive method Hanoi Tower Problem)
文件列表:
Q.java (794, 2008-10-22)
Ackerman.java (868, 2008-10-22)
ChickenQuestion.java (657, 2008-10-21)
Factorial1.java (664, 2008-10-21)
Factorial2.java (770, 2008-10-21)
Fibonacci1.java (555, 2008-10-21)
Fibonacci2.java (714, 2008-10-21)
GreatestCommonDivisor.java (962, 2008-10-22)
Hanoi.java (731, 2008-10-21)
Permutation.java (1570, 2008-10-22)
近期下载者:
相关文件:
收藏者: