Data Structures and Algorithm Analysis in Ada - Couverture rigide

Mark Allen Weiss is a Professor in the School of Computer Science at Florida International University. He received his Ph.D. in Computer Science from Princeton University where he studied under Robert Sedgewick. Dr.Weiss has received FIU's Excellence in Research Award, as well as the Teaching Incentive Program Award, which was established by the Florida Legislature to recognize teaching excellence. Mark Allen Weiss is on the Advanced Placement Computer Science Development Committee. He is the successful author of Algorithms, Data Structures, and Problem Solving with C++ and the series Data Structures and Algorithm Analysis in Pascal, Ada, C, and C++, with Addison-Wesley.

The author's important research on algorithm analysis is reflected in the clarity and currency of presentation in this Ada version of his bestselling book on data structures and algorithms. Many new and innovative data structures, such as Leftist Heaps and Splay Trees, are carefully explained and illustrated. Weiss' approach to data structures incorporates ADTs and algorithm analysis with a heavy emphasis on performance and running time. The presentation is amply illustrated with diagrams and figures.