Fibonacci Algorithm in Java Array
Code 1 package fibonaccinumber; 2 3 import java.util.Arrays; 4 5 public class FibonacciNumber 6 { 7 public static int [] generate ( int num) 8 { 9 int [] result= new int [num]; 10 result[0]=0; 11 result[1]=1; 12 for ( int i=2;i<num;i++){ 13 result[i]=result[i-1]+result[i-2]; 14 if (result[i]<0){ 15 System. out .println( " Out of range! " ); 16 break ; 17 } 18 } 19 return result; 20 } 21 public static void main (String[] args) { 22 int num=20; //numbers of fibonacci number 23 int [] fibo=FibonacciNumber . generate (20); 24 System. out .println(Arrays. toString (fibo)); 25 } 26 } 27 Output run: [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181] BUILD SUCCESSFUL (total time: 0 seconds) Video Tutorial

