recursive function

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

Noun[edit]

recursive function (plural recursive functions)

  1. (computing) Any function that uses recursion and can call itself until a certain condition is met.
  2. (mathematics) Any function whose value may be obtained using a finite number of operations using a precisely specified algorithm.

Hypernyms[edit]

Hyponyms[edit]

References[edit]