Book Description:
Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures
Greater emphasis on abstract data types (ADTs) 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, Batcher’s sorting networks, randomized BSTs, splay trees, skip lists, multiway tries, and much more
Increased quantitative information about the algorithms, including extensive empirical studies and basic analytic studies, giving you a basis for comparing them
Over 1000 new exercises to help you learn the properties of algorithms
download
No comments:
Post a Comment