Last active
August 29, 2015 13:58
-
-
Save gbarrancos/9933518 to your computer and use it in GitHub Desktop.
Fibonacci implementation using closures in Go
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package main | |
import "fmt" | |
// fibonacci is a function that returns | |
// a function that returns an int. | |
func fibonacci() func() int { | |
seqIndex := -1 | |
lastFib := 0 | |
beforeLastFib := 0 | |
return func() int { | |
seqIndex += 1 | |
if seqIndex == 0 { | |
lastFib = 0 | |
} else if seqIndex == 1 { | |
lastFib = 1 | |
} else { | |
newFib := lastFib + beforeLastFib //fib(n) = fib(n - 1) + fib(n - 2) | |
beforeLastFib = lastFib | |
lastFib = newFib | |
} | |
return lastFib | |
} | |
} | |
func main() { | |
f := fibonacci() | |
for i := 0; i < 10; i++ { | |
fmt.Println(f()) | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment