Package com.zybooks.dsaj.recursion
Class Fibonacci
java.lang.Object
com.zybooks.dsaj.recursion.Fibonacci
Demonstration of two recursive approaches to computing Fibonacci numbers.
-
Constructor Summary
-
Method Summary
Modifier and TypeMethodDescriptionstatic int
fibonacci
(int n) Don't call this (infinite) version.static long
fibonacciBad
(int n) Returns the nth Fibonacci number (inefficiently).static long[]
fibonacciGood
(int n) Returns array containing the pair of Fibonacci numbers, F(n) and F(n-1).static void
-
Constructor Details
-
Fibonacci
public Fibonacci()
-
-
Method Details
-
fibonacciBad
public static long fibonacciBad(int n) Returns the nth Fibonacci number (inefficiently). -
fibonacciGood
public static long[] fibonacciGood(int n) Returns array containing the pair of Fibonacci numbers, F(n) and F(n-1). -
fibonacci
public static int fibonacci(int n) Don't call this (infinite) version. -
main
-