Description: Main algorithm is Feibonaxi series that Fib [j] = Fib [j-1]+ Fib [j-2] the order from to 0 to N is to obey the order of the total Feibonaxi series, so The algorithm can be obtained by total number of methods. With an array Redr [] to receive input data, ie data input with a while loop with a for loop to achieve Feibonaxi series that Fib [] array, with Fib [] array to Redr [] array is evaluated for each data member the total number of ways, and then remember [] array of input data stored in each of the total number of ways, with the final output for loop
To Search:
File list (Check if you may need any files):
Redraiment小时候走路喜欢蹦蹦跳跳.doc
Download