Algorithms and Data Structures - Oberon

5 Algorithms and data Structures N. Wirth 1985 ( Oberon version: August 2004) Contents Preface 1 Fundamental data Structures Introduction The Concept of data Type Primitive data Types Standard Primitive Types Integer types The type REAL The type BOOLEAN The type CHAR The type SET The Array structure The Record structure Representation of Arrays, Records, and Sets Representation of Arrays Representation of Recors Representation of Sets The File (Sequence) Elementary File Operators Buffering Sequences Buffering between Concurrent Processes Textual Input and Output Searching Linear Search Binary Search Table Search Straight String Search The Knuth-Morris-Pratt String Search The Boyer-Moore String Search Exercises 2 Sorting Introduction Sorting Arrays Sorting by Straight Insertion Sorting by Straight Selection Sorting by Straight Exchange Advanced Sorting Methods Insertion Sort by Diminishing Increment Tree Sort Partition Sort Finding the Median A Comparison of Array Sorting Methods Sorting Sequences Straight Merging Natural Merging Balanced Multiway Merging Polyphase Sort Distribution of Initial Runs Exercises

6 3 Recursive Algorithms 3.1 Introduction 3.2 When Not to Use Recursion 3.3 Two Examples of Recursive Programs 3.4 Backtracking Algorithms

Loading..

Tags:

  Data, Structure, Example, Data structures

Information

Related search queries