This is a test in Go for Fibonacci in an iterative way. The algorithm disolays the entire suite to provided 'n' and the time it took to compute

fibonacci.go

package main

import "fmt"
import (
	"time"
	"log"
)

func main() {
    fibonacci(1000)
}

func fibonacci(n int)  {
	start := time.Now()
u:=0
v:=1
var (
    t int
	)

for i:=2; i <= n ;i++ {
    t = u + v
    u = v
    v = t
    fmt.Println(v)
	}

	elapsed := time.Since(start)
	log.Printf("Fibonacci of %v took %s",n, elapsed)
}