What are the examples of recursion algorithms

Summary

An object is called recursiveif it contains itself as part or is defined in terms of itself. Recursion occurs not only in math, but also in everyday life. Who has never seen advertising images that contain themselves?

This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

literature

  1. 3.1.

    D.G. McVitie and L.B. Wilson. The stable marriage problem. Comm ACM, Dec., No. 7 (1971), 486-92. MathSciNetCrossRefGoogle Scholar

  2. 3.2.

    D.G. McVitie and L.B. Wilson. Stable Marriage Assignment for Unequal Sets. Bit, 10, (1970), 295-309.zbMATHCrossRefGoogle Scholar

  3. 3.3.

    Space Filling Curves, or How to Waste Time on a Plotter. softwarePractice and Experience, 1, No. 4 (1971), 403-40. CrossRefGoogle Scholar

  4. 3.4.

    N. Wirth. Program Development by Stepwise Refinement. Comm ACM, 14, No. 4 (1971), 221-27.zbMATHCrossRefGoogle Scholar

  5. 3.5.

    L. Allison. Stable Marriages by Coroutines. Info. Proc Letters, 16 (1983), 61-65.zbMATHCrossRefGoogle Scholar

Copyright information

© B. G. Teubner, Stuttgart 1986

Authors and Affiliations

  1. 1st Federal Technical University of ZurichSwitzerland