Algorithms + Data Structures = Programs
Condition: SECONDHAND
This is a secondhand book. The jacket image is a photograph of the exact copy we have in stock. This image shows the condition of this book. Further condition remarks are below.
Condition remarks:
Book: Good
Jacket: Worn/faded, no tears
Pages: Good
Few titles in computer science carry the weight of a mathematical equation, but Niklaus Wirth's landmark work does exactly that — asserting with elegant precision that the discipline of programming is inseparable from the twin pillars of algorithms and data structures. Published in 1976 as part of the Prentice-Hall Series in Automatic Computation, this foundational text presents a lucid and systematic treatment of basic and dynamic data structures, sorting, recursive algorithms, and language structures, culminating in a rigorous study of compiling — all illustrated through programs written in Pascal, a language Wirth himself designed. Wirth, one of the towering figures of 20th-century computer science and a recipient of the ACM Turing Award, argues throughout that good programming is not merely a craft but a disciplined science rooted in the careful selection of data representation and algorithmic strategy. His prose is characteristically clear and penetrating, making abstract computational concepts accessible without sacrificing intellectual depth. Decades after its first printing, this volume endures as a seminal reference that shaped generations of programmers and computer scientists — one that continues to challenge readers to think not just about whether a program works, but why it works, and how it could work better.
Author: Niklaus Wirth
Format: Hardback
Published: 1976, Prentice-Hall
Genre: Science
Condition remarks:
Book: Good
Jacket: Worn/faded, no tears
Pages: Good
Few titles in computer science carry the weight of a mathematical equation, but Niklaus Wirth's landmark work does exactly that — asserting with elegant precision that the discipline of programming is inseparable from the twin pillars of algorithms and data structures. Published in 1976 as part of the Prentice-Hall Series in Automatic Computation, this foundational text presents a lucid and systematic treatment of basic and dynamic data structures, sorting, recursive algorithms, and language structures, culminating in a rigorous study of compiling — all illustrated through programs written in Pascal, a language Wirth himself designed. Wirth, one of the towering figures of 20th-century computer science and a recipient of the ACM Turing Award, argues throughout that good programming is not merely a craft but a disciplined science rooted in the careful selection of data representation and algorithmic strategy. His prose is characteristically clear and penetrating, making abstract computational concepts accessible without sacrificing intellectual depth. Decades after its first printing, this volume endures as a seminal reference that shaped generations of programmers and computer scientists — one that continues to challenge readers to think not just about whether a program works, but why it works, and how it could work better.