recursion

A noun referring to a process or expression in which each term is generated by repeating a particular mathematical operation, often involving self-reference.

• 🇫🇷Substantif désignant un procédé ou une expression dans lequel chaque élément est engendré par la répétition d’une opération mathématique ou informatique donnée, souvent par auto-référence.

1. Mathematical recursion C1 formal scientific

   A method of defining a sequence or function where each term is generated by applying a fixed rule to previous terms.

   • The Fibonacci sequence is defined by recursion, where each number is the sum of the two preceding ones.
   • Recursion is used to define factorials: n! = n * (n-1)!.
   • In mathematics, recursion allows for the compact definition of complex sequences.

   🇫🇷Récurrence (mathématiques)

   Synonymes: recurrencerecursive definition

2. Programming recursion B2 formal IT

   A technique in computer programming where a function calls itself to solve a problem by breaking it down into smaller, similar subproblems.

   • The algorithm uses recursion to traverse a binary tree.
   • Recursion can simplify code for problems like sorting and searching.
   • A recursive function must have a base case to avoid infinite loops.

   🇫🇷Récursivité (en programmation)

• recursions plural form
• recursions' possessive plural form
• recursion's possessive singular form