Question

_______ recursion consists of multiple self-references.

(a) binary recursion

(b) single recursion

(c) multiple recursion

(d) coinductive recursion

I got this question during an interview.

I want to ask this question from Recursion in chapter Induction and Recursion of Discrete Mathematics

Answer 1

Right option is (c) multiple recursion

Best explanation: A recursion which consists of multiple self-references and requires exponential time and space is called multiple recursion. Multiple recursions include tree traversal of a graph, such as in a depth-first search. However, single recursion is more efficient than multiple recursion.