Recursion (computer science)
= Recursion
{disambiguate=computer science}
{wiki}
= Recursion
{synonym}
<Recursion> solves a problem by invoking the same procedure on smaller instances, with base cases answered directly. For <merge sort>, an empty or one-entry <array> is already sorted, and every larger <array> is split into two shorter parts. The decreasing lengths justify termination; a self-call without a progress rule would not suffice.