oprava existující anotace, přidání nové anotace
Název:
Autor:
Robert Sedgewick
Rok vydání:
1998
Identifikátory:
9780201350883
Expanded coverage of arrays, linked lists, strings, trees, and other basic
data structures Greater emphasis on abstract data types (ADTs), modular programming, object-oriented programming, and C++ classes than in previous editions
Over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations
New implementations of binomial queues, multiway radix sorting, randomized BSTs, splay trees, skip lists, multiway tries, B trees, extendible hashing, and much more Increased quantitative information about the algorithms, giving you a
basis for comparing them Over 1000 new exercises to help you learn the properties of algorithms Whether you are learning the algorithms for the first time or wish to have up-to-date reference material that incorporates new programming styles with classic and new algorithms, you will find a wealth of useful information in this book.
© 2013-2024 Obálkyknih.cz - Jihočeská vědecká knihovna v Českých Budějovicích, admin@obalkyknih.cz