recursion

[rɪˈkəːʃ(ə)n]

recursion Definition

• 1. the repeated application of a recursive procedure or definition
• 2. a function that calls itself

Using recursion: Examples

Take a moment to familiarize yourself with how "recursion" can be used in various situations through the following examples!

• Example

  The program uses recursion to solve the problem.

• Example

  Recursion is a fundamental concept in computer science.

• Example

  The function is defined recursively.

recursion Synonyms and Antonyms

Synonyms for recursion

• iteration
• looping
• repetition

Phrases with recursion

• recursive formula

  a formula that defines each term of a sequence using one or more previous terms

  Example

  The Fibonacci sequence is defined by a recursive formula.

• recursive process

  a process that repeats itself indefinitely

  Example

  The recursive process continues until a certain condition is met.

• recursive descent parser

  a type of parsing technique that uses recursive procedures to parse a string of symbols

  Example

  The compiler uses a recursive descent parser to analyze the source code.

📌

Summary: recursion in Brief

Recursion [rɪˈkəːʃ(ə)n] refers to the repeated application of a recursive procedure or definition, such as a function that calls itself. It is a fundamental concept in computer science and is used to solve problems and define sequences. Examples include 'The program uses recursion to solve the problem' and 'The function is defined recursively.'