This book is devoted to recursion in programming, the technique by which the solution to a problem is expressed partly in terms of the solution to a simpler version of the same problem. Ultimately the solution to the simplest version must be given explicitly. In functional programming, recursion has received its full due since it is quite often the only repetitive construct. However, the programming language used here is Pascal and the examples have been chosen accordingly. It makes an interesting contrast with the use of recursion in functional and logic programming. The early chapters consider simple linear recursion using examples such as finding the highest common factor of a pair of numbers, and processing linked lists. Subsequent chapters move up through binary recursion, with examples which include the Towers of Hanoi problem and symbolic differentiation, to general recursion. The book contains well over 100 examples.
Average Rating
Informations
About the author
Jeffrey Soden Rohl
Author
Recursion Via Pascal
by Jeffrey Soden Rohl
Books Like Recursion Via Pascal
If you're looking for books similar to Recursion Via Pascal, here are some recommendations based on themes, tone, and narrative style.
The Art of Computer Programming: Fundamental Algorithms
Donald Knuth
A seminal work in computer science that provides deep insights into algorithmic thinking. Knuth explores fundamental programming techniques with mathematical precision and clarity. The book offers comprehensive coverage of recursive algorithms and computational methods. It is considered a bible of algorithmic design by computer scientists worldwide. The text provides profound insights into problem-solving strategies.
Introduction to Algorithms
Thomas Cormen
A comprehensive textbook covering fundamental algorithmic techniques and design principles. The book provides detailed explanations of recursive algorithms and computational strategies. It offers in-depth analysis of problem-solving approaches across various computational domains. Cormen's work is widely used in computer science education and professional development. The text bridges theoretical concepts with practical implementation.
Structure and Interpretation of Computer Programs
Harold Abelson
A groundbreaking text exploring fundamental principles of computer programming. The book provides deep insights into computational thinking and recursive techniques. It offers a comprehensive approach to understanding programming language design. Abelson explores complex computational concepts with clarity and precision. The text is considered a landmark in computer science education.
Algorithms in Pascal
Robert Sedgewick
A comprehensive guide to algorithm design and implementation using Pascal. The book provides detailed explanations of fundamental algorithms, data structures, and programming techniques. It offers practical examples and in-depth analysis of computational problem-solving strategies. Sedgewick's work is considered a classic text for computer science students and programmers. The book complements Rohl's approach to recursion with a broader algorithmic perspective.
Functional Programming in Pascal
Ken Slonneger
An exploration of functional programming concepts within the Pascal language. The book delves into advanced programming paradigms and recursive techniques. It provides a deep understanding of how functional programming principles can be applied in Pascal. The text offers numerous examples and practical applications of recursive algorithms. Slonneger's work bridges theoretical concepts with practical implementation.
Data Structures and Algorithms in Pascal
Ellis Horowitz
A comprehensive examination of data structures and algorithmic design using Pascal. The book provides in-depth coverage of recursive algorithms and their implementation. It explores various computational techniques with practical examples and detailed explanations. Horowitz offers insights into problem-solving strategies and efficient algorithm design. The text is particularly valuable for understanding complex recursive approaches.
Discrete Mathematics and Its Applications
Kenneth Rosen
A foundational text exploring mathematical concepts fundamental to computer science. The book provides deep insights into recursive thinking and algorithmic design. It covers mathematical principles that underpin computational problem-solving strategies. Rosen offers clear explanations of complex mathematical concepts relevant to programming. The text is essential for understanding recursive techniques.
Programming Pearls
Jon Bentley
A classic collection of programming insights and problem-solving techniques. Bentley explores innovative approaches to computational challenges with elegant solutions. The book provides practical wisdom about algorithm design and recursive thinking. It offers numerous examples of creative problem-solving in computer programming. The text is renowned for its practical and insightful approach.
Concepts of Programming Languages
Robert Sebesta
A comprehensive exploration of programming language design and implementation. The book provides insights into various programming paradigms and computational techniques. It offers detailed analysis of language features and recursive programming approaches. Sebesta examines the theoretical foundations of programming language design. The text is valuable for understanding computational thinking.
Algorithms
Robert Sedgewick
A comprehensive guide to algorithm design and implementation. The book provides detailed coverage of recursive techniques and computational strategies. It offers practical examples of problem-solving approaches in computer science. Sedgewick explores various algorithmic paradigms with mathematical rigor. The text is essential for understanding advanced computational techniques.
Computational Complexity
Christos Papadimitriou
An advanced exploration of computational theory and algorithmic complexity. The book provides deep insights into recursive problem-solving strategies. It offers mathematical analysis of computational challenges and algorithmic efficiency. Papadimitriou examines fundamental principles of computational thinking. The text is crucial for understanding advanced algorithmic design.
Concrete Mathematics
Ronald Graham
A comprehensive exploration of mathematical techniques fundamental to computer science. The book provides deep insights into recursive mathematical thinking. It offers advanced mathematical approaches to computational problem-solving. Graham explores complex mathematical concepts with clarity and precision. The text is essential for understanding advanced computational strategies.
Algorithm Design
Jon Kleinberg
A comprehensive guide to advanced algorithmic techniques and design principles. The book provides detailed exploration of recursive problem-solving strategies. It offers practical approaches to computational challenges across various domains. Kleinberg examines fundamental principles of algorithmic thinking. The text is valuable for understanding complex computational techniques.
Computational Geometry
Mark de Berg
An advanced exploration of geometric algorithms and computational techniques. The book provides deep insights into recursive approaches to geometric problems. It offers mathematical analysis of complex computational challenges. De Berg examines advanced algorithmic strategies with precision. The text is crucial for understanding geometric computational thinking.
No account connected — sign in to comment.