Open Data Structures

← Back to document page

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.

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

  Data, Book