High-performance Fibonacci numbers implementation in Go
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
.gitignore
.travis.yml
LICENSE
README.md
fib.go
fib_test.go

README.md

High-performance Fibonacci numbers implementation in Go

Build Status GitHub issues Go Report Card Coverage Status GoDoc GitHub license

In mathematics, the Fibonacci numbers are the numbers in the following integer sequence, called the Fibonacci sequence, and characterized by the fact that every number after the first two is the sum of the two preceding ones:

1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ...

Often, especially in modern usage, the sequence is extended by one more initial term:

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ...

This implementation has two methods: Fibonacci and FibonacciBig.

The Fibonacci function is more efficient, however, it returns correct numbers between 0 and 93 (inclusive). The FibonacciBig function, on the other hand, is less efficient but returns practically any Fibonacci number.

Example:

package main

import (
  "fmt"
  "github.com/t-pwk/go-fibonacci"
)

func main() {
  fmt.Println("20:  ", fib.Fibonacci(20))
  fmt.Println("200: ", fib.FibonacciBig(200))
}

And the output is

20:   6765
200:  280571172992510140037611932413038677189525