文件名称：C++递归数组排列及查询
文件大小：3KB
文件格式：ZIP
更新时间：2016-06-13 14:37:37
fibonacci 递归排列
Please use recursion（递归）to get fibonacci numbers（一种整数数列）. The user will specify（指定，详细说明） how many of the numbers he or she wants to print. You can use the main function to print the numbers, but make sure that the recursive function is being called recursively to get the numbers. Store the fibonacci numbers in an array（数组）. Assume that the largest array size necessary will be 20.
【文件预览】：
four
----main.cpp(1KB)
----four.pro.user(21KB)
----four.pro(306B)