Questions And Answers

More Tutorials

Go Function Recursion

A recursive function is a function in code that refers to itself for execution. Recursive functions can be simple or elaborate. They allow for more efficient code writing, for instance, in the listing or compiling of sets of numbers, strings or other variables through a single reiterated process.

In Go, we can do recursion and have the function call itself until it reaches a stop condition.

Go Recursion Functions example

Below is an example of recursion function in Go that does the factorial.

package main
import "fmt"

func factorial(num int) int {
   if num == 1 || num == 0{
      return num
   return num * factorial(num-1)

func main(){




In this page (written and validated by ) you learned about Go Function Recursion . What's Next? If you are interested in completing Go tutorial, your next topic will be learning about: Go Function closures.

Incorrect info or code snippet? We take very seriously the accuracy of the information provided on our website. We also make sure to test all snippets and examples provided for each section. If you find any incorrect information, please send us an email about the issue:

Share On:

Mockstacks was launched to help beginners learn programming languages; the site is optimized with no Ads as, Ads might slow down the performance. We also don't track any personal information; we also don't collect any kind of data unless the user provided us a corrected information. Almost all examples have been tested. Tutorials, references, and examples are constantly reviewed to avoid errors, but we cannot warrant full correctness of all content. By using, you agree to have read and accepted our terms of use, cookies and privacy policy.