Algorithms and Data Structures
Algorithms and Data Structures
Algorithms and Data Structures
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
N.Wirth. <strong>Algorithms</strong> <strong>and</strong> <strong>Data</strong> <strong>Structures</strong>. Oberon version 2<br />
Table of Contents<br />
Preface<br />
Preface To The 1985 Edition<br />
Notation<br />
1 Fundamental <strong>Data</strong> <strong>Structures</strong> 10<br />
1.1 Introduction<br />
1.2 The Concept of <strong>Data</strong> Type<br />
1.3 St<strong>and</strong>ard Primitive Types<br />
1.3.1 The type INTEGER<br />
1.3.2 The type REAL<br />
1.3.3 The type BOOLEAN<br />
1.3.4 The type CHAR<br />
1.3.5 The type SET<br />
1.4 The Array Structure<br />
1.5 The Record Structure<br />
1.6 Representation of Arrays, Records, <strong>and</strong> Sets<br />
1.6.1 Representation of Arrays<br />
1.6.2 Representation of Records<br />
1.6.3 Representation of Sets<br />
1.7 The File (Sequence)<br />
1.7.1 Elementary File Operators<br />
1.7.2 Buffering Sequences<br />
1.7.3 Buffering between Concurrent Processes<br />
1.7.4 Textual Input <strong>and</strong> Output<br />
1.8 Searching<br />
1.8.1 Linear Search<br />
1.8.2 Binary Search<br />
1.8.3 Table Search<br />
1.9 String Search<br />
1.9.1 Straight String Search<br />
1.9.2 The Knuth-Morris-Pratt String Search<br />
1.9.3 The Boyer-Moore String Search<br />
Exercises<br />
References<br />
2 Sorting 50<br />
2.1 Introduction<br />
2.2 Sorting Arrays<br />
2.2.1 Sorting by Straight Insertion<br />
2.2.2 Sorting by Straight Selection<br />
2.2.3 Sorting by Straight Exchange<br />
2.3 Advanced Sorting Methods<br />
2.3.1 Insertion Sort by Diminishing Increment<br />
2.3.2 Tree Sort<br />
2.3.3 Partition Sort<br />
2.3.4 Finding the Median
Change language