Algorithms & Data Structures

Offering a unique introduction, authors Nievergelt and Hinrichs focus on themes that lead readers rapidly to important concepts, insights, and techniques in a few core areas of computer science.

Part I highlights simple concepts necessary for programming motion, geometry, and graphics; devotes a section to dialog control; and shows examples of algorithm animation techniques in action.

Part II develops an open-ended dialect of Pascal; builds reusable program modules; and reviews recursion pictures using three data structures and recursive pictures as examples.

Part III builds up a collection of problems and algorithms that uses a variety of data types.

Part IV provides the mathematical background necessary for systematic treatment of complexity.

Part V introduces the concept of abstract data type as tool to separate functionalspecification and implementation and presents the most important data structures with their access algorithms.

Part VI demonstrates that the data structures developed in Part V are essential to the efficiency of most of the algorithms presented here; presents an in-depth look at the plane-sweep algorithm; and introduces efficient and robust geometric computation.