jdd.examples

Class Fibonacci

java.lang.Object

jdd.examples.Fibonacci

public class Fibonacci
extends Object

A simple example that has nothing to do with BDDs :(

This class demonstrates how the Fibonacci numbers can be computed recursively but still a bit efficient by using a cache...

See this more as a (very simple) tutorial on how the caches work in JDD than an example on what JDD can do.

and oh yeah...for those of you who slept during the math lessons:

   F(0) = 0
   F(1) = 1
   F(n) = F(n-1) + F(n-2)
 

Constructor Summary

Constructors

Constructor and Description
Fibonacci()

Method Summary

Modifier and Type	Method and Description
static double	fibonacci(int n) recursively (!!!) compute the fibonacci number for n
static void	main(String[] args)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Fibonacci

public Fibonacci()

Method Detail

fibonacci

public static double fibonacci(int n)

recursively (!!!) compute the fibonacci number for n

main

public static void main(String[] args)