Created
May 23, 2013 21:39
-
-
Save eranation/5639637 to your computer and use it in GitHub Desktop.
Solution to Exercise: Fibonacci closure from http://tour.golang.org/#43
This file contains hidden or 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 { | |
// first 2 negative fib numbers - see bidirectional sequence at http://en.wikipedia.org/wiki/Fibonacci_number | |
fib1 := -1 | |
fib2 := 1 | |
return func() int { | |
nextFib := fib1 + fib2 | |
fib1 = fib2 | |
fib2 = nextFib | |
return nextFib | |
} | |
} | |
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