OpenDataStructures(inpseudocode)

Open Data Structures (in pseudocode)Edition Pat MorinContentsAcknowledgmentsixWhy This Book?xi1 The Need for Efficiency.. Interfaces.. The Queue, Stack, and Deque Interfaces.. The List Interface: Linear Sequences.. The USet Interface: Unordered Sets.. The SSet Interface: Sorted Sets.. Mathematical Background.. Exponentials and Logarithms.. Factorials.. Asymptotic Notation.. Randomization and Probability.. The Model of Computation.. Correctness, Time Complexity, and Space Complexity.. Code Samples.. List of Data Structures.. Discussion and Exercises.. 232 Array-Based ArrayStack: Fast Stack Operations Using an Array.. The Basics.. Growing and Shrinking.. Summary.. FastArrayStack: An Optimized ArrayStack.. ArrayQueue: An Array-Based Queue.. Summary.. ArrayDeque: Fast Deque Operations Using an Array.. Summary.. DualArrayDeque: Building a Deque from Two Stacks.

Contents 8 ScapegoatTrees 165 8.1 ScapegoatTree: A Binary Search Tree with Partial Rebuilding166 8.1.1 Analysis of Correctness and Running-Time . . . . . 170

Loading..

Tags:

  Opendatastructures

Information