Search⌘ K
Home
Courses
The Way to Go

Solution Review: Compute Factorial of a Number

Explore how to write a recursive function in Go to calculate the factorial of numbers between 0 and 21. Understand the importance of base and recursive cases and practice looping through inputs to produce correct outputs.

We'll cover the following...
Go (1.6.2)
package main
import (
	"fmt"
)
func main() {
	for i := uint64(0); i < uint64(22); i++ {
		fmt.Printf("Factorial of %d is %d\n", i, Factorial(i)) // calculating factorial of first 21 integers
	}
}
// named return variables:
func Factorial(n uint64) (fac uint64) {
	if n<=1{ 	//base case
		return 1
	}
	fac = n * Factorial(n-1)	// recursive case
	return
}

In main, we are calling function Factorial for numbers between 0 and 21 inclusively using for loop at line 7, and printing the result ...