Recursion via Pascal

DOI10.1017/CBO9781139171793MaRDI QIDQ3339243zbMATH OpenOpenAlexFDO

Authors Jeffrey S. Rohl

Publication date 1984

Full work available at URL https://doi.org/10.1017/cbo9781139171793

zbMATH Keywords

recursive procedurerecursionPascal

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01)

Recommendations

• scientific article; zbMATH DE number 4052970
• Modeling recursion with the aid of iterative algorithms
• scientific article; zbMATH DE number 1226891
• scientific article; zbMATH DE number 1371691
• scientific article; zbMATH DE number 194612

Cited in

(10)

• Tours de Hanoï et automates
• Modeling recursion with the aid of iterative algorithms
• Introduction to recursive programming
• Recursion in computer science curriculum
• scientific article; zbMATH DE number 4013991 (Why is no real title available?)
• New efficient programs to calculate general recoupling coefficients. II: Evaluation of a summation formula
• Euclid, Fibonacci, and Pascal—recursed!
• scientific article; zbMATH DE number 194837 (Why is no real title available?)
• scientific article; zbMATH DE number 3887103 (Why is no real title available?)
• Nested arrays and recursion

This page was built for publication: Recursion via Pascal

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3339243)