mutually recursive
Transcription
-
- US Pronunciation
- US IPA
-
-
- US Pronunciation
- US IPA
-
Definitions of mutually recursive words
- abbreviation Technical meaning of MUTUALLY RECURSIVE recursion 3
- noun Definition of mutually recursive 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
Information block about the term
Parts of speech for Mutually recursive
noun
adjective
verb
adverb
pronoun
preposition
conjunction
determiner
exclamation
See also
Matching words
- Words starting with m
- Words starting with mu
- Words starting with mut
- Words starting with mutu
- Words starting with mutua
- Words starting with mutual
- Words starting with mutuall
- Words starting with mutually
- Words starting with mutuallyr
- Words starting with mutuallyre
- Words starting with mutuallyrec
- Words starting with mutuallyrecu
- Words starting with mutuallyrecur
- Words starting with mutuallyrecurs
Was this page helpful?
Thank you for your feedback! Tell your friends about this page
Tell us why?