Hi
> Can anyone recommend a good programming text, or reference (online or
> off line), that covers the topic of data structures, such as linked
> lists, trees, etc., in a clear, concise manner, on both the abstract
> and applied level. In my opinion a good reference should start with
> the basics in which the basics (definition, structure, etc..) of such
> data structures is presented and then build on these basics in a "well
> structured" manner. Generic (non language specific) algorithms should
> be presented and further built upon, eventually translated into actual
> programs and practical applications and considerations. Illustrations,
> diagrams, and schematics should be used when & where needed to clarify
> a concept.
Cormen Leiserson & Rivest.
Introduction to Algorithms
Mit Press ISBN 0-262-53091-0
McGraw Hill ISBN 0-07-013143-0
This book is very good and very concise. It uses only pseudo code and
covers a lot of data structures and algorithms. A lot of basic stuff and
a selection of specialities from the authors' research fields. Very good
treatment of the ``big O'' notation. (roughly 1000 pages)
There is also, of course,
Donald E Knuth
The Art of Computer Programming
Volumes I, II & III
It is very interesting to read _parts_ of it. It is not easy, though, and
it is also a bit less than ``modern''. If you want the definite truth
about a classic algorithm (or data structure) of computer science, and if
you want to know the history of an algorithm as well as the correct
spelling of the name of the guy who invented it ... these are what you
want. (A great number of pages)
Andreas
