Write a Java Program to print Fibonacci Series using Recursion.

1.	Write a Java Program to print Fibonacci Series using Recursion.
Answer» class InterviewBit { public static void printFibonacci(int val_1, int val_2, int num){ //Base Case if(num == 0) return; //Printing the next Fibonacci number System.out.PRINT( val_1 + val_2 + " "); //Recursively calling for printing Fibonacci for remaining length printFibonacci(val_2, val_1+val_2, --num); } public static void main(String args[]) { System.out.println(" * Fibonacci Series * "); //Printing the FIRST two values System.out.print("0 1 "); //Calling Method to print the fibonacci for length 10 printFibonacci(0, 1, 10); }} In the above code, we are printing the base 2 Fibonacci values 0 and 1. And then based on the length of Fibonacci to be printed, we are using the helper FUNCTION to print that.

Answer»

class InterviewBit { public static void printFibonacci(int val_1, int val_2, int num){ //Base Case if(num == 0) return; //Printing the next Fibonacci number System.out.PRINT( val_1 + val_2 + " "); //Recursively calling for printing Fibonacci for remaining length printFibonacci(val_2, val_1+val_2, --num); } public static void main(String args[]) { System.out.println(" *** Fibonacci Series *** "); //Printing the FIRST two values System.out.print("0 1 "); //Calling Method to print the fibonacci for length 10 printFibonacci(0, 1, 10); }}

In the above code, we are printing the base 2 Fibonacci values 0 and 1. And then based on the length of Fibonacci to be printed, we are using the helper FUNCTION to print that.

Discussion

No Comment Found

Related InterviewSolutions

Implement Binary Search in Java using recursion.
Write a Java program for solving the Tower of Hanoi Problem.
Write a java program to check if any number given as input is the sum of 2 prime numbers.
Write a Java program to rotate arrays 90 degree clockwise by taking matrices from user input.
Write a Java program to reverse a string.
Write a Java program to create and throw custom exceptions.
Write a Java Program to check if any number is a magic number or not. A number is said to be a magic number if after doing sum of digits in each step and inturn doing sum of digits of that sum, the ultimate result (when there is only one digit left) is 1.
Given an array of non-duplicating numbers from 1 to n where one number is missing, write an efficient java program to find that missing number.
Write a Java Program to find the factorial of a given number.
Write a Java program to check if the two strings are anagrams.