18 lines
307 B
Go
18 lines
307 B
Go
|
package main
|
||
|
|
|
||
|
|
import "fmt"
|
||
|
|
|
||
|
|
// fib berechnet die n-te Fibonacci-Zahl rekursiv.
|
||
|
|
// Korrekt, aber für n > 40 sehr langsam (exponentiell).
|
||
|
|
func fib(n int) int {
|
||
|
|
if n <= 1 {
|
||
|
|
return n
|
||
|
|
}
|
||
|
|
return fib(n-1) + fib(n-2)
|
||
|
|
}
|
||
|
|
|
||
|
|
func main() {
|
||
|
|
for i := 0; i <= 10; i++ {
|
||
|
|
fmt.Printf("fib(%2d) = %d\n", i, fib(i))
|
||
|
|
}
|
||
|
|
}
|