mutual recursion

M m

Transcription

- US Pronunciation
- US IPA

- US Pronunciation
- US IPA

Definitions of mutual recursion words

abbreviation Technical meaning of MUTUAL RECURSION recursion 3
noun Definition of mutual recursion in Technology (mathematics, programming) When a function (or procedure) calls itself. Such a function is called "recursive". If the call is via one or more other functions then this group of functions are called "mutually recursive". If a function will always call itself, however it is called, then it will never terminate. Usually however, it first performs some test on its arguments to check for a "base case" - a condition under which it can return a value without calling itself. The canonical example of a recursive function is factorial: factorial 0 = 1 factorial n = n * factorial (n-1) Functional programming languages rely heavily on recursion, using it where a procedural language would use iteration. See also recursion, recursive definition, tail recursion. 1

See all 2 definitions of mutual recursion

Information block about the term

Parts of speech for Mutual recursion

noun

adjective

verb

adverb

pronoun

preposition

conjunction

determiner

exclamation

Full grammatical hierarchy of Mutual recursion

See also

All definitions of mutual recursion

Matching words

Was this page helpful?

Yes No

Thank you for your feedback! Tell your friends about this page

Tell us why?