scientific article; zbMATH DE number 1179093

From MaRDI portal
Publication:4398797





Central idea is the concept of the abstract data type (ADT). The book has three parts: In the first part (``Fundamental) are treated: algorithms, complexity and the implementation of algorithms and data structures in C and C++. In the second part (``Basic Data Structures) we find lists, stacks and queues as well as binary search trees and hasing. The third part (``Advanced Data Structures) defines another analysis-method for algorithms: the ``amortized analysis, which leads to another and in many cases closer and more realistic worst-case bound for the running time of correlated operations of a ADT. In this paper too, we find balanced search trees, keaps, special dynamic sets and graphs, including some classical algorithms on graphs. Two appendices are containing two short mathematical tutorials: a) On sums and recurrences and b) On sets, counting and some graph-theoretical definitions. A didactically well organized textbook for students on the undergraduate to graduate level.












This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4398797)