recursive routine
- noun
- /rɪˈkɜːrsɪv ruˈtiːn/
- Specialized
:
rutina recursiva
- The factorial function is often implemented using a recursive routine.
Examples
-
He wrote a recursive routine to calculate factorials.
-
Many programming languages support the creation of a recursive routine for solving complex problems.
-
If the base case is not defined, a recursive routine can result in infinite loops.
-
A recursive routine can simplify complex problems.
-
The factorial function is often implemented using a recursive routine.
-
Many programming languages support the creation of a recursive routine for solving complex problems.
-
If the base case is not defined, a recursive routine can result in infinite loops.
How Complex
- Specialized
- Specialized
2
4.6
- Specialized
1
4.4
- Specialized
72
7.5
Surface Forms
Morphology
Given knowledge of 'recursive' (processes that refer to themselves) and 'routine' (a set of program instructions), a learner can infer a 'recursive routine' as a routine that refers to or calls itself. The phrase is a straightforward adjective+noun composition used in technical contexts and its meaning is directly derivable from the constituents, making it transparent.
Etymology
The noun recursive routine gives a clear picture: imagine a person who keeps asking themselves to do the same small job again and again. Here recursive means 'repeating' and routine means 'a set of steps', so the routine 'calls itself' and repeats until there is a clear 'stop', which is why the term means a part of a program that repeats by calling itself.