Computing very large Fibonacci numbers

  •        0

A tool written in C++ to generate very large Fibonacci numbers using the primary recursive formula: F(n) = F(n-1) + F(n-2) n gt; 1; F(1) = 1, F(0) = 0.

http://fib-number.sourceforge.net

Tags
Implementation
License
Platform

   

comments powered by Disqus


Related Projects

Pythoidc - PythoidC is the C language of Python style, fast as C, easy as Python


PythoidC is the C language like the Python, by the Python and for the Python -- CHEN Guang,MD Department of Dermatology, No.1 Hospital of China Medical University ADVANTAGES: 1. Braceless (no {}), semicolonless (no ; at line ends), white space sensitive (indent/unindent region to express code block) 2. Auto-completion: no need to remember all the functions, constants, data structures and their corresponding H file. PythoidC automatically parses all the H files, and thus realized step by step aut

cpdproject


def fib(n): if n == 0 or n == 1: return n else: # This recursion is not good for large numbers. return fib(n-1) + fib(n-2)

Fibcriptoaes - AES 128 192 256bit encryption


def fib(n): if n == 0 or n == 1: return n else: # This recursion is not good for large numbers. return fib(n-1) + fib(n-2)

Cyberz - Test


def fib(n): if n == 0 or n == 1: return n else: # This recursion is not good for large numbers. return fib(n-1) + fib(n-2)

Blackhound21rise - i love predator


def fib(n): if n == 0 or n == 1: return n else: # This recursion is not good for large numbers. return fib(n-1) + fib(n-2)

Blackhoundrise - predator reborn


def fib(n): if n == 0 or n == 1: return n else: # This recursion is not good for large numbers. return fib(n-1) + fib(n-2)

Noticiaeblog - Dicas e hacks


def fib(n): if n == 0 or n == 1: return n else: # This recursion is not good for large numbers. return fib(n-1) + fib(n-2)

knife114


def fib(n): if n == 0 or n == 1: return n else: This recursion is not good for large numbers. return fib(n-1) + fib(n-2)

Outguessproject - testproject


def fib(n): if n == 0 or n == 1: return n else: # This recursion is not good for large numbers. return fib(n-1) + fib(n-2)

Febelfin - bibliothèque


def fib(n): if n == 0 or n == 1: return n else: # This recursion is not good for large numbers. return fib(n-1) + fib(n-2)