terminal recursion
[ˈtɜːrmɪnəl rɪˈkɜːrʒən]
nounpl: terminal recursions
recursão terminal
1. A type of recursion where the recursive call is the last operation performed in a function, allowing the compiler to optimize it into an iterative loop
The factorial function can be implemented using terminal recursion to improve memory efficiency.
A função fatorial pode ser implementada usando recursão terminal para melhorar a eficiência de memória.
2. Also known as tail recursion, it is a form of recursion where no additional computation occurs after the recursive call returns
Terminal recursion is particularly efficient in functional programming languages like Scheme and Lisp.
A recursão terminal é particularmente eficiente em linguagens de programação funcional como Scheme e Lisp.
Terminal recursion is a computer science concept primarily discussed in programming and algorithm courses. It is valued in functional programming communities and is particularly important in languages that support tail call optimization. The term is used identically in both Brazilian Portuguese and European Portuguese technical communities, reflecting the universal nature of programming terminology.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →