Transcription of Open Data Structures
{{id}} {{{paragraph}}}
Open data Structures (in Java)Edition MorinContentsAcknowledgmentsixWhy This book ?xi1 The Need for Efficiency .. Interfaces .. ,Stack, andDequeInterfaces .. : Linear Sequences .. : Unordered Sets .. : Sorted Sets .. Mathematical Background .. and Logarithms .. Notation .. and Probability .. The Model of Computation .. Correctness, Time Complexity, and Space Complexity .. Code Samples .. List of data Structures .. Discussion and Exercises .. 262 Array-Based : Fast Stack Operations Using an Array .. Basics .. and Shrinking .. : An Optimized ArrayStack .. : An Array-Based Queue .. : Fast Deque Operations Using an Array.
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}}}