Transcription of Algorithms and Data Structures - Oberon
{{id}} {{{paragraph}}}
Example: bachelor of science
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
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:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
Related search queries
Introduction to Algorithms, A Computational Introduction to Number Theory, Algorithms, Data mining, Automated Bitcoin Trading via Machine Learning, Automated Bitcoin Trading via Machine Learning Algorithms, Practical Guide to Implementing Solar Panel MPPT, INTRODUCTION, Statistical Models of Appearance