斐波那契数列递归和非递归算法

/**
 * @author David
 * 斐波那契数列递归和非递归算法
 */
public class FeiBoNaQie {

	public int fun(int k){
		int value;
		if(k==1||k==2){
			value = 1;
		}else{
			value  = fun(k-1) + fun(k-2);
		}
		return value;
	}
	
	public int fun2(int k){
		int value = 0;
		if(k==1||k==2){
			value = 1;
		}else{
			//i j 作为中间运算值
			int i=1;
			int j=1;
			//计算器
			int q=1;
			while(q!=k-1){
				value = i+j;
				i = j;
				j = value;
				q++;
			}
		}
		return value;
	}
	
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		FeiBoNaQie feQie = new FeiBoNaQie();
		System.out.println(feQie.fun2(5));
	}

}