Open Data Structures

← Back to document page

open data Structures (in C++). Edition . Pat Morin Contents Acknowledgments ix Why This Book? xi Preface to the C++ Edition xiii 1 Introduction 1. The Need for Efficiency . . . . . . . . . . . . . . . . . . . . . 2. Interfaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4. The Queue, Stack, and Deque Interfaces . . . . . . . 5. The List Interface: Linear Sequences . . . . . . . . . 6. The USet Interface: Unordered Sets . . . . . . . . . . 8. The SSet Interface: Sorted Sets . . . . . . . . . . . . 8. Mathematical Background . . . . . . . . . . . . . . . . . . . 9. Exponentials and Logarithms . . . . . . . . . . . . . 10. Factorials . . . . . . . . . . . . . . . . . . . . . . . . . 11. Asymptotic Notation . . . . . . . . . . . . . . . . . . 12. Randomization and Probability . . . . . . . . . . . . 15. The Model of Computation . . . . . . . . . . . . . . . . . . . 18. Correctness, Time Complexity, and Space Complexity.

Acknowledgments I am grateful to Nima Hoda, who spent a summer tirelessly proofread-ing many of the chapters in this book; to the students in the Fall 2011

  Open, Data, Structure, Open data structures