Algorithms
|
| |
ISBN |
0201066734 |
|
Release Date |
30 November 1999 |
|
Category |
Algorithms |
|
Tags |
algorithms,
algorithm,
sedgewick,
algorithm design,
introduction to algorithms,
computer algorithms,
algorithms in c,
robert sedgewick,
algorithms in c++,
algorithm analysis,
genetic algorithm,
computer algorithm,
edge detection,
"algorithms",
the algorithm design manual,
"robert sedgewick",
algo,
algorit,
introduction to algorithm,
robert lafore,
distributed algorithms,
introduction algorithms,
algorithm design manual,
algorithms c++,
algorithm in c,
|
|
This book @Amazon |
View |
|
Description
This book presents an interesting challenge. It talks about algorithms yet it does not present algorithms, nor does it define algorithm as anything more than a "problem-solving method suitable for implementation as computer programs[p.4]." Instead, it exhibits programs which are the implementations of algorithms and discusses them as if the algorithm is apparent. The reader is left with the challenge of learning to discriminate between what is essential about an algorithm, and how to preserve that in an implementation, versus what is inessential to the algorithm and introduced on account of the implementation and the use of particular programming tools.
I am concerned that this approach, while well-motivated, is not successful. My evidence is in the criticisms of this and later editions that dwell on the choice of programming language and on stylistic matters in the use of the chosen language. This places too much emphasis on code. Although code rules these days, I remain unconvinced that this simplification is a good thing. For me, one of the great insights in development of software is identification of layers of abstraction for conquering the organization of complex application programs. Separating design, algorithm and implementation is a critical first step toward that mastery.
Meanwhile, "Algorithms" serves up a handy set of recipes for a variety of basic computing situations. The 45 sections cover fundamental methods of widespread application in computing and software development. The presentations are straightforward and illuminating. The compilation bears re-examination every time one sits down to identify key methods for a new application.
I recommend supplementing this material with the practical methods of Kernighan and Plauger's "Software Tools" and the insightful explorations of Bentley's "Programming Pearls." Most of all I encourage development of enough sense of the material in Donald Knuth's "Art of Computer Programming" to be able to read the discussions of algorithms and problems there, even if you never use the particular implementations. |
Other books on Algorithms
|
