菲波那契数列的通项

package com.recursion;

import java.util.Scanner;

public class fibonacci {

	public static int k=0;

	public static void main(String[] args) {
	
		Scanner cin = new Scanner(System.in);
		long a = 9;
		System.out.println(fibonacci(a));
		System.out.println("共递归调用了"+k+"次");
	}
	
	public static long fibonacci(long m)
	{
		if(m==0 || m==1)
		{
			k++;
			return m;
		}
		else
			return fibonacci(m-1)+fibonacci(m-2);
	}

}