Search⌘ K
Home
Courses
The Way to Go

Solution Review: Finding Fibonacci Numbers with Slices

Explore how to compute Fibonacci numbers in Go using slices. Understand function structure, slice initialization, and loop-based Fibonacci calculations. This lesson enhances your skills in array and slice management within Go programming.

We'll cover the following...
Go (1.6.2)
package main
import "fmt"
func main() {
	result := fibarray(5)
	for ix, fib := range result {
		fmt.Printf("The %d-th Fibonacci number is: %d\n", ix,  fib)
	}
}
func fibarray(term int) []int {	// calculating Fibonacci for first term numbers
	farr := make([]int, term)
	//base case
	if term == 1 {
		farr[0] = 0
		return farr
	}
	farr[0], farr[1] = 0, 1		
	
	// recursive case
	for i:= 2; i < term; i++ {
		farr[i] = farr[i-1] + farr[i-2]	// calculating sequence for i index
	}
	return farr
}

In the code above, look at the header of the function fibarray at line 11, which takes term as the input and returns the Fibonacci sequence until term in an array of type int. We make ...