Buy Books Online from Programming Books Store

Elements of Programming Other products by Addison-Wesley Professional Ratting 4.5 Out of 5.0 Special Offer Total New 31 Use
	List Price: $39.99 Our Price: $27.96 Price Save:   $8.00    Total Price: $27.96 at of 2010-09-03
Product prices and availability are accurate as of the date/time indicated and are subject to change. Any price and availability information displayed on [amazon.com or endless.com, as applicable] at the time of purchase will apply to the purchase of this product.

Buy Low Price From Here Now

“Ask a mechanical, structural, or electrical engineer how far they would get without a heavy reliance on a firm mathematical foundation, and they will tell you, ‘not far.’ Yet so-called software engineers often practice their art with little or no idea of the mathematical underpinnings of what they are doing. And then we wonder why software is notorious for being delivered late and full of bugs, while other engineers routinely deliver finished bridges, automobiles, electrical appliances, etc., on time and with only minor defects. This book sets out to redress this imbalance. Members of my advanced development team at Adobe who took the course based on the same material all benefited greatly from the time invested. It may appear as a highly technical text intended only for computer scientists, but it should be required reading for all practicing software engineers.”
    —Martin Newell, Adobe Fellow

 “The book contains some of the most beautiful code I have ever seen.”
    —Bjarne Stroustrup, Designer of C++

“I am happy to see the content of Alex’s course, the development and teaching of which I strongly supported as the CTO of Silicon Graphics, now available to all programmers in this elegant little book.”
    —Forest Baskett, General Partner, New Enterprise Associates

“Paul’s patience and architectural experience helped to organize Alex’s  mathematical approach into a tightly-structured edifice—an impressive feat!”
    —Robert W. Taylor, Founder of Xerox PARC CSL and DEC Systems Research Center

Elements of Programming provides a different understanding of programming than is presented elsewhere. Its major premise is that practical programming, like other areas of science and engineering,must be based on a solid mathematical foundation. The book shows that algorithms implemented in a real programming language, such as C++, can operate in the most general mathematical setting. For example, the fast exponentiation  algorithm is defined to work with any associative operation. Using abstract algorithms leads to efficient, reliable, secure, and economical software.

This is not an easy book. Nor is it a compilation of tips and tricks for incremental improvements in your programming skills. The book’s value is more fundamental and, ultimately, more critical for insight into programming. To benefit fully, you will need to work through it from beginning to end, reading the code, proving the lemmas, and doing the exercises. When finished, you will see how the application of the deductive method to your programs assures that your system’s software components will work together and behave as they must.

The book presents a number of algorithms and requirements for types on which they are defined. The code for these descriptions—also available on the Web—is written in a small subset of C++ meant to be accessible to any experienced programmer. This subset is defined in a special language appendix coauthored by Sean Parent and Bjarne Stroustrup.

Whether you are a software developer, or any other professional for whom programming is an important activity, or a committed student, you will come to understand what the book’s experienced authors have been teaching and demonstrating for years—that mathematics is good for programming, and that theory is good for practice.

Technical Details

See more technical details

 "haphazard collection of ideas" 2010-08-13
By Tom (Palo Alto, CA)
The book uses a variety of common mathematical structures as the basis for examples of algorithms and their translation into code. In its presentations, it emphasizes mathematical and formal analysis. Examples are in C++.

However, it's difficult to see who this book is actually aimed at. The mathematical sophistication and use of C++ make it a bad choice as an introductory textbook. Few of the mathematical structures or reasoning have much relevance to day-to-day programming. The formal analysis differs substantially from standard formal methods. And mathematicians tend not to require an explanation of formal or mathematical reasoning, when they reach for a programming book, they want quick and effective software solutions.

This book may appeal to mathematically inclined C++ developers. But this mathematically inclined long-time C++ programmer never warmed up to it. I think there are better introductory textbooks, better textbooks on formal methods and program correctness, and better textbooks for mathematicians and scientists wanting to learn about programming.


 "Dumbells for your Programming Muscles" 2010-05-28
By Jason E. Thompson (AUS)
I wanted to find a book that would give a very formal and mathematical perspective on computer programming and that is what I got. I found this book very difficult to read. The concepts were often foreign, abstract and often described in a very terse manor. However, after reading and re-reading sections of the book it started to slowly make sense. Once I started understanding a little bit it made more and more sense and I really started to appreciate what the book was doing.

I have never come across problem solving presented in this manor before. The algorithms initially appear quite cryptic but once I read and desk-checked the algorithms they came across as quite clever - who would have thought there was so much to be said about 'power algorithm'. I would recommend this book to anyone who is up for a challenge - who can appreciate code that doesn't have an immediate application to business application development. It is certainly not an easy read and is suited to mathematically minded programmer.

That being said, I do have some complaints. Sometimes the book comes across as overly terse, they give one explanation that's it. It could have used diagrams to better communicate an idea. It lacks an explicit overarching theme and direction.

There is one warning I will give to the prospectus buyer: "The book does not have worked examples, solutions to the exercises, nor does it give proofs for all of the lemmas." This is not a real problem but it breaks the flow of the book as you have to stop and convince yourself that the information presented is correct.

All and all it is a stimulating, interesting and challenging book.


 "Important steps towards formalizing the work of programming" 2010-01-14
By Trevor Baca (Austin, TX)
Because Ralabate's review covers the most important points, this review should be read as supplemental to it.

First, the book makes substantial contributions towards regularizing the terminology of algorithm design and analysis. Concepts like regularity, transformation, accumulation and ordering that are treated as notional in most other presentations of the material are here given rigorous formalization. This matters because understanding whether a type or procedure is regular (chapter 1) helps explain the availability of the different types of iterator definable against it (chapter 6). Likewise, understanding which algebraic structures are available against the input to an algorithm (chapter 5) can clarify both the boundary cases to the algorithm and the avenues open for its optimization.

Second, because early chapters introduce terminology on which the later chapters build, the book should be read in order. (This point is made in the preface, but bears repeating here.) Chapters, and the examples they contain, are short and relatively easy to accomplish in a sitting or two, which makes sequential reading straightforward. (The exceptions to this are project suggestions, which require a different level of attention but which can be skipped working from chapter to chapter.)

Third, the math on which Stepanov and McJones rely will be familiar to second- or third-year CS or engineering undergrads. Examples are taken from set theory, matrices and the foundations of abstract algebra (groups and rings); advanced understanding of continuous mathematics is not assumed. (Willingness to work out examples with pencil and paper still important, however.)

Fourth, the subset of C++ in which the examples in the book are presented should embolden, rather than discourage, developers working primarily in other languages. With the exception of the templating instructions that wrap each of the examples, there's nothing particularly C++-ish in the examples. The examples are kept short and they read at least as well as any sort of pseudocode that might have been devised as an alternative. (No problems coming from recent work done primarily in Python, for example.)

Fifth, antagonism between the type of algorithm analysis presented here and the fundamentals of object orientation is misguided. Among very many other things, object orientation affords a type of systems design oriented in terms of *things*. How should data and methods be bundled? Which parts of the system need to be exposed and which encapsulated? Is functionality best acquired through inheritance or aggregation? The type of analysis that Stepanov and McJones provide operates at what is arguably more fundamental a level. How are assumptions of regularity related to optimization? When is special-case optimization warranted? To get a feeling for this, read chapter two on what happens in the repeated application of a transformation to its own output. The code and presentation of the material demonstrate a closed set of possibilities *regardless of the algorithm being investigated*, along with terminology and descriptors for each of the different cases. I find it hard to see how generalization can go much further than this, and the presentation of the material is a pleasure. (Maybe best to use chapter 2 as a litmus test, in fact, to see whether you want to work the book to completion.)

Last, the whole book can be read as a challenge. To what extent can the fundamentals of algorithm design be treated rigorously? It's probably reaching to draw a comparison to the situation before different parts of the math system were defined in terms of set theory, but, in some respects, that does seem to be where we are: many different, notional approaches to what it means to program, with decades' worth of best practices built up, but absent a series of definitions on which to anchor different types of programming work. Stepanov and McJones help take us at least a little bit closer to such a long-term goal.


 "Serious approaches to algorithms & engineering for the hardcore computer science geek" 2009-11-27
By James Holmes (South Central Ohio)
This book is heavy on math and in-depth, intricate concepts. It's somewhat low on applicability for me in my line of work - but I'm sure lots of other folks will find it very useful. Lots of concise, in-depth discussion of foundational knowledge, and plenty of exercises to help evolve your skills.

The tone's exceedingly dry and academic, and I got very tired of the authors repeated assertions that you need to be using a "real programming language such as C++." Guess all the value-providing projects I've helped roll out in Perl, Java, C#, and other languages haven't counted.

That said, this is a wonderful book for those interested in raising their skills in hardcore algorithms and low-level software engineering.


 "Must read for all computer scientists" 2009-11-10
By Felipe Magno De Almeida (Rio de Janeiro, Brazil)
This book defines lots of usual STL algorithms and uses with algebra. This makes a comprehensive writing process for algorithms and concepts. This book is a must read for anybody that wants or is a programmer. This book also shows how regular types are the core of rationing in imperative programming, and the value of value-based programming, no pun intended.




Images Product



Read more Elements of Programming