Recursion via Pascal

DOI10.1017/CBO9781139171793zbMATH Open0547.68003OpenAlexW621941035MaRDI QIDQ3339243FDOQ3339243

Authors: Jeffrey S. Rohl 

Publication date: 1984

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

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

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)

Cited In (10)

• Modeling recursion with the aid of iterative algorithms
• Introduction to recursive programming
• Recursion in computer science curriculum
• Title not available (Why is that?)
• New efficient programs to calculate general recoupling coefficients. II: Evaluation of a summation formula
• Euclid, Fibonacci, and Pascal—recursed!
• Title not available (Why is that?)
• Title not available (Why is that?)
• Nested arrays and recursion
• Tours de Hanoï et automates

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)