文件名称：国外数列题目
文件大小：370KB
文件格式：RAR
更新时间：2017-03-29 15:11:13
Fibonacci Sequence
一个国外的java数列题目 Divide & Conquer 1. Sub-problems need not leave the main problem type unchanged 2. Sub-problems need not be of the same type 3. Integration of the sub-problems need not be easily accomplished, i.e., they may not be solved by “direct observation”. Recursion 1. Removal of a sub-problem from the original problem leaves the problem type unchanged until a residual problem is so simple that it can be solved in a “direct manner”, i.e., the base case 2. Recursion is a special case of the Divide & Conquer category. 3. A recursive method always calls itself until the base case is reached.
【文件预览】：
Comp+182+Project+1+Compare+Algorithms.pdf
111111111111111111111111.pdf