day17--递归

1.递归

递归：就是一个函数不断引用自身，直到引用的唯一已知对象时止的过程

2.递归实现斐波那契数列和累加

package com.datastructure;

public class Recursion {
	
	//累加
	public static int sumToN(int paraN) {
		if (paraN <= 0) {
			return 0;
		}
		return sumToN(paraN - 1) + paraN;
	}// of sumToN
	//斐波那契数列
	public static int fibonacci(int paraN) {
		if (paraN <= 0) {
			return 0;
		} if (paraN == 1) {
			return 1;
		}//of if		
		return fibonacci(paraN - 1) + fibonacci(paraN - 2);
	}//of fibonacci
	
	public static void main(String args[]) {
		int tempValue = 5;
		System.out.println("0 sum to " + tempValue + " = " + sumToN(tempValue));
		tempValue = -1;
		System.out.println("0 sum to " + tempValue + " = " + sumToN(tempValue));
		
		for(int i = 0; i < 10; i ++) {
			System.out.println("Fibonacci " + i + ": " + fibonacci(i));
		}//of for i
	}// of main
}// of class

运行结果：