$(3\mathrm{.}1\mathrm{.}6)$ A recursive algorithm is said to be generative when its recursive calls $$generate$$ new data: when they require arguments that are not smaller instances of the same problem. Such algorithms can often be more difficult to prove, as the basic inductive hypothesis does not apply to their recursive calls.