Fibonacci Sum sequence

Fibonacci Sum function

650) this.width=650; "src=" Http://s2.51cto.com/wyfs02/M00/83/A3/wKioL1d5uk3S-_cKAAAR4vt2tQw982.png "title=" Qq20160704092111.png "alt=" Wkiol1d5uk3s-_ckaaar4vt2tqw982.png "/>

Import Java.util.arraylist;public class Fib {/* * Fibonacci sequence * recursive */public static int Fib (int n) {if (n<=0) {return 0;} else if (n==1) {return 1;} Else{return fib (n-1) +fib (n-2);}} /* * Non-recursive */public static long ffib (int n,arraylist<long> fiblist) {if (n<=0) {fiblist.add (0l); return 0;} else if (n==1) {fiblist.add (0l); Fiblist.add (1l); return 1;} Else{long F1=0;fiblist.add (F1); long F2=1;fiblist.add (F2); long f=0;for (int i=2;i<=n;i++) {f=f1+f2;fiblist.add (f); F1=f2;f2=f;} return f;}} public static void Main (string[] args) {arraylist<long> fiblist=new arraylist<long> (); FIB.FFIB (fiblist); for (Long l:fiblist) {System.out.print (L + "");}}

Generating Fibonacci sequences within n=10

650) this.width=650; "src=" Http://s3.51cto.com/wyfs02/M01/83/A3/wKioL1d5uuyRS_87AAATuGFOiDA419.png "title=" Qq20160704092420.png "alt=" Wkiol1d5uuyrs_87aaatugfoida419.png "/>

Fibonacci Sum sequence