Efficient Java Program for Fibonacci Series Using Recursive Method

package in.studyecart.impprograms;

import java.util.Scanner;

public class SECJAP111_2 {

	public static void main(String[] args) {
		//Fibonacci Series 0,1,1,2,3,5,8,13... with Recursive
		
		int val1=0,val2=1,val3=0;//count=10;
		
		Scanner input=new Scanner(System.in);
		System.out.println("Please Enter Limit:");
		int count=input.nextInt();
		
		System.out.print(val1+","+val2);
		
		getFibonacci(val1,val2,count);
	
	}
	
	static void getFibonacci(int val1,int val2,int count) {
		
		if(count>2) {
		int val3=val1+val2;
		System.out.print(","+val3);
		val1=val2;
		val2=val3;
		getFibonacci(val1,val2,count-1);
		}
		
	}
	
	
}

(code-box)