Definitions from Wiktionary (recursive function)
▸ noun: (computing) Any function that uses recursion and can call itself until a certain condition is met.
▸ noun: (mathematics) Any function whose value may be obtained using a finite number of operations using a precisely specified algorithm.
partial recursive function,
total recursive function,
Primitive recursive function,
General recursive function,
more...
▸ Words similar to recursive function
▸ Usage examples for recursive function
▸ Idioms related to recursive function
▸ Wikipedia articles (New!)
▸ Words that often appear near recursive function
▸ Rhymes of recursive function
▸ Invented words related to recursive function
▸ noun: (computing) Any function that uses recursion and can call itself until a certain condition is met.
▸ noun: (mathematics) Any function whose value may be obtained using a finite number of operations using a precisely specified algorithm.
Similar:
tail recursion,
procedure,
function,
user-defined function,
iteration,
restricted function,
predefined function,
coroutine,
built-in function,
metafunction,
more...
Opposite:
Types:
Phrases:
▸ Words similar to recursive function
▸ Usage examples for recursive function
▸ Idioms related to recursive function
▸ Wikipedia articles (New!)
▸ Words that often appear near recursive function
▸ Rhymes of recursive function
▸ Invented words related to recursive function