
Livro digital
Título:
Open Data Structures: An Introduction
Autor:
Pat Morin
Categoria:
Tecnologia > Backend
Doador:
Raffaello D. N.
Sinopse:
Efficiency stops being an abstraction when every operation has a cost you can trace. Beginning with queues, stacks, deques, lists, sets, asymptotic notation, and probability, Pat Morin builds the mathematical and computational foundation needed to judge a data structure by correctness, running time, and space usage—not by intuition alone.
The progression moves from array-based and linked lists to skiplists, hash tables, and binary search trees, then reaches randomized trees, scapegoat trees, red-black trees, heaps, sorting algorithms, graphs, integer-search structures, and external-memory searching. Pseudocode keeps the ideas independent of any one programming language, while careful analyses reveal why growing, shrinking, balancing, hashing, and rebuilding strategies work.
This is a practical bridge between an algorithms course and real implementation work. Each structure is developed from its interface through its operations and performance guarantees, with discussions and exercises that invite the reader to test the design choices. The result is a reusable mental toolkit for selecting, implementing, and defending data structures in systems where time and memory genuinely matter.