Recursion: meaning, definitions and examples
🔄
recursion
[ rɪˈkərʒən ]
programming
Recursion is a programming technique where a function calls itself in order to solve a problem. It involves breaking a problem down into smaller subproblems and solving each of them recursively.
Synonyms
iteration, looping, repetition
Examples of usage
- Recursion is commonly used in algorithms like factorial calculation and Fibonacci sequence generation.
- The concept of recursion can be challenging for beginners to grasp.
- In recursion, the function keeps calling itself until a base condition is met.
mathematics
In mathematics, recursion refers to a process where a function is defined in terms of itself. It is often used in defining sequences and series.
Synonyms
iteration, repetition, self-reference
Examples of usage
- The Fibonacci sequence is a classic example of recursion in mathematics.
- Recursive formulas are used to generate terms of a sequence based on previous terms.
general
Recursion can also refer to the repeated application of a rule, procedure, or formula to successive results.
Synonyms
iteration, reiteration, repetition
Examples of usage
- The concept of recursion can be found in various fields such as linguistics and psychology.
- In linguistics, recursion plays a role in the generation of complex sentences.
Translations
Translations of the word "recursion" in other languages:
🇵🇹 recursão
🇮🇳 पुनरावृत्ति
🇩🇪 Rekursion
🇮🇩 rekursi
🇺🇦 рекурсія
🇵🇱 rekurencja
🇯🇵 再帰 (さいき)
🇫🇷 récursivité
🇪🇸 recursión
🇹🇷 özyineleme
🇰🇷 재귀
🇸🇦 التكرار
🇨🇿 rekurze
🇸🇰 rekurzia
🇨🇳 递归 (dìguī)
🇸🇮 rekurzija
🇮🇸 endurkvæmi
🇰🇿 рекурсия
🇬🇪 რეკურსია
🇦🇿 rekursiya
🇲🇽 recursión
Word origin
The term 'recursion' originated from the Latin verb 'recurrere', meaning 'to run back'. The concept of recursion has been used in various disciplines throughout history, but it gained prominence in computer science and mathematics due to its powerful problem-solving capabilities.