Recursion functions are supported in Go. While recursive functions are not unique to go, they are useful for solving special kinds of problems.

## Example

### Introduction

In the previous articles we have discussed functions. What makes a function recursive?

A function is recursive if it:

- Calls itself
- Reaches the stop condition

The function below is *not* a recursive function:

func hello() { |

Because it calls itself (1), but *it doesnâ€™t have a stop condition* (2).

But the function below is *a recursive function*. It matches both conditions;

func countdown(x int) int { |

### Factorial function

In the example we create a factorial function and make it calculate `3!`

.

Here is the recursive function:

func factorial(x uint) uint { |

If called, the function calls itself:

return x * factorial(x-1) |

And it has a stop condition `x == 0`

. After which it ends the function execution.

Full code below:

package main |

### Exercises

- When is a function recursive?
- Can a recursive function call non-recursive functions?

Leave a Reply