Print Fibonacci Serial Inwards Coffee Using Recursion Too For Loop

Printing Fibonacci Series In Java or writing a plan to generate Fibonacci lay out is i of the interesting coding problem, used to learn college kids recursion, an of import concept where component calls itself. It is too used a lot equally coding problems field interviewing graduate programmers, equally it presents lots of interesting follow-up questions equally well. In Fibonacci series, adjacent lay out is equal to amount of previous 2 numbers. First 2 numbers of serial are ever 1 together with 1, tertiary lay out becomes 1 + 1 = 2, afterward quaternary lay out becomes 2 + 1 = 3. So a Fibonacci serial looks similar 1, 1, 2, 3, 5, 8, 11, nineteen together with hence on, equally shown inwards the icon equally well. This work is quite slow to solve yesteryear using recursion together with a greater instance that how recursion tin flaming exactly solution inwards to a greater extent than or less cases e.g. linked listing together with binary tree, where component behaves similar whole. For example, when yous take a node from linked list, its to a greater extent than or less other list, similarly if yous accept a component of tree, is to a greater extent than or less other tree, which agency same algorithm tin flaming hold out applied to them. Any way, If yous larn this query on interview, yous are to a greater extent than probable to come upward up alongside recursive version first, equally it's natural. Interviewer volition straightaway inquire yous to generate Fibonacci serial without recursion. Which agency yous attain got to come upward up alongside Iterative solution using loops. You tin flaming too clarify whether additional information construction is allowed or not, equally many recursive solution tin flaming hold out converted into iterative i yesteryear using Stack information structure. In this case, likely yous don't involve it.

Fibonacci Series using Recursion

In a recursive algorithm in that place are 2 parts, i inwards which component calls itself together with on other where it furnish something, this is called base of operations case, without this your plan volition never terminate together with top alongside stackoverflow error. When yous solve a work alongside recursion, yous must origin cry back nearly the base case. In instance of Fibonacci series, the best instance if 1st 2 numbers.  Here is the recursive solution of generating Fibonacci number, which tin flaming hold out used to print Fibonacci series.

public static int getFibonacci(int n) {         if (n == 1) {             return 1;         }         if (n == 2) {             return 1;         }         return getFibonacci(n - 1) + getFibonacci(n - 2); }

You tin flaming run into that if n = 1 or n = 2 together with hence our component furnish 1, otherwise it telephone telephone itself to generate a novel Fibonacci lay out which is amount of previous two.

Fibonacci Series using For Loop

Now, let's run into how nosotros tin flaming impress Fibonacci serial without using recursion.

public static void fibonacci(int number) {         int fibo1 = 1;         int fibo2 = 1;          System.out.printf("%nFibonacci serial of %d numbers are : ", number);         System.out.printf("%s ", fibo1);         System.out.printf("%s ", fibo2);          for (int i = 2; i < number; i++) {             int fibonacci = fibo1 + fibo2;             System.out.printf("%s ", fibonacci);             fibo2 = fibo1;             fibo1 = fibonacci;         } }

You tin flaming run into that the logic is non real dissimilar than what nosotros attain got used inwards recursive version, but this fourth dimension nosotros attain got used for loop. Here is the geometric icon yous get, when yous depict Fibonacci series.

Fibonacci Series inwards Java using for loop together with Recursion

Here is the consummate sample code of printing Fibonacci serial inwards Java yesteryear using recursion or for loop. As an exercise, tin flaming yous write to a greater extent than or less JUnit attempt case for this plan together with it's methods.

import java.util.Arrays; import java.util.Scanner;  /**  * Java plan to uncovering Fibonacci serial of a given lay out together with impress them inwards  * console. For example, if input is ix together with hence your plan should impress 1 1 2 iii v  * 8 xiii 21 34 55 89  *  * @author WINDOWS 8  *  */ public class HelloAndroid {      public static void main(String args[]) {         fibonacci(8);         fibonacci(9);         fibonacci(10);          fibonacciSeries(11);         fibonacciSeries(12);      }      /*      * Printing Fibonacci serial of a given lay out using for loop      */     public static void fibonacci(int number) {         int fibo1 = 1;         int fibo2 = 1;          System.out.printf("%nFibonacci serial of %d numbers are : ", number);         System.out.printf("%s ", fibo1);         System.out.printf("%s ", fibo2);          for (int i = 2; i < number; i++) {             int fibonacci = fibo1 + fibo2;             System.out.printf("%s ", fibonacci);             fibo2 = fibo1;             fibo1 = fibonacci;         }     }      public static void fibonacciSeries(int number) {         System.out.printf("\nFibonacci serial inwards Java of lay out %s using recursion %n", number);         for (int i = 1; i <= number; i++) {             System.out.printf("%s ", getFibonacci(i));         }      }      /*      * Fibonacci serial inwards Java of a given lay out Recursion.      */     public static int getFibonacci(int n) {         if (n == 1) {             return 1;         }         if (n == 2) {             return 1;         }         return getFibonacci(n - 1) + getFibonacci(n - 2);     }  }   Output Fibonacci serial of 8 numbers are : 1 1 2 3 5 8 13 21 Fibonacci serial of 9 numbers are : 1 1 2 3 5 8 13 21 34 Fibonacci serial of 10 numbers are : 1 1 2 3 5 8 13 21 34 55 Fibonacci serial inwards Java of lay out 11 using recursion 1 1 2 3 5 8 13 21 34 55 89 Fibonacci serial inwards Java of lay out 12 using recursion 1 1 2 3 5 8 13 21 34 55 89 144

That's all nearly how to impress Fibonacci Series inwards Java alongside together with without using recursion. You tin flaming farther amend this solution yesteryear using a technique called memoization, which stores already calculated lay out inwards a cache inwards lodge to avoid calculating them again. This saves lot of processing fourth dimension inwards damage of modest memory, together with specially useful field calculating large Fibonacci number. I would advise to endeavour yourself origin to come upward up a Fibonacci Series alongside memoization, but yous tin flaming ever refer to my solution.

If yous similar this tutorial together with looking for to a greater extent than or less to a greater extent than challenging algorithm questions together with hence checkout my listing of algorithm based coding questions :

1. How to banking concern fit if 2 String are Anagram of each other? (Solution)
2. Recursive algorithm to calculate Sum of Digits of a lay out inwards Java? (Solution)
3. How to preclude Deadlock inwards Java? (Click here for solution)
4. Swap Two Numbers without using Temp Variable inwards Java? (Trick)
5. How to calculate factorial using recursion inwards Java? (Click here for solution)
6. Java plan to banking concern fit if a lay out is Armstrong lay out or not? (Solution)
7. Java plan to take duplicates from ArrayList? (Solution)
8. Program to uncovering occurrences of  a grapheme inwards String? (Solution)
9. How to uncovering middle chemical component of LinkedList inwards i top without recursion? (See here for Solution)
10. Algorithm to banking concern fit if a lay out is Prime or not? (Solution)
11. Give Algorithm to uncovering if LinkedList contains Cycle? (Solution)
12. How to solve Producer Consumer Problem inwards Java. (Solution)
13. Give Algorithm to uncovering if Array contains duplicates? (Solution)
14. Program to larn origin non repeated characters from String inwards Java? (See here for solution)
15. Algorithm to banking concern fit if lay out is Power of Two? (Answer)
16. Algorithm to take duplicates from array without using Collection API? (Solution)
17. Program to String inwards Java using recursion? (Solution)
18. Algorithm to banking concern fit if a lay out is Palindrome? (Solution)
19. How to banking concern fit if a lay out is binary inwards Java? (Solution)

Further Learning
The Coding Interview Bootcamp: Algorithms + Data Structures
Data Structures together with Algorithms: Deep Dive Using Java
Algorithms together with Data Structures - Part 1 together with 2

Share this post