Transcription of Open Data Structures
{{id}} {{{paragraph}}}
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 .. 19. Code Samples .. 22. List of data Structures .. 22. Discussion and Exercises .. 25. 2 Array-Based Lists 29. ArrayStack: Fast Stack Operations Using an Array .. 31. The Basics .. 31. Contents Growing and Shrinking .. 34. Summary .. 36. FastArrayStack: An Optimized ArrayStack.
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
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}