---
title: "Discussion on \"Recursion\" | Hashnode"
description: "Discussion on \"Recursion\". Recursion is basically a process that calls itself until it reaches the finish condition.\nHere's a factorial algorithm as an example:\nfunction factorial(num) {\n// End of the recursion\nif (num === 1) return num;\n// Calls itself decreasing the input by..."
url: "https://hashnode.com/posts/recursion/66f318e10f4dd5acfeae2015"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Recursion](https://luizcelso.com/recursion?utm_source=hashnode&utm_medium=feed)

Recursion is basically a process that calls itself until it reaches the finish condition. Here's a factorial algorithm as an example: function factorial(num) { // End of the recursion if (num === 1) return num; // Calls itself decreasing the input by...

Sep 24, 2024 · 2 min read · luizcelso.com  
Updated Nov 18, 2024  
Read the article

-   [#back2school](https://hashnode.com/tag/back2school)
-   [#algorithms](https://hashnode.com/tag/algorithms)
-   [#javascript](https://hashnode.com/tag/javascript)
-   [#datastructure](https://hashnode.com/tag/datastructure)
-   [#recursion](https://hashnode.com/tag/recursion)

## Written by

[Luiz Celso Pergentino](https://hashnode.com/@luizcelso)

@luizcelso

  
[View profile](https://hashnode.com/@luizcelso)

Senior Software Engineer

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
