scientific article; zbMATH DE number 3980450

From MaRDI portal
Publication:3745241





As this is the fourth edition of an already classic handbook of programming, priority should be given to the changes and to the new addings. First of all, Modula-2 replaced Pascal in the presentation of algorithms. Keeping im mind what the first edition (Stuttgart 1975; Zbl 0353.68002) represented for Pascal, this modification would probably have a greater influence on Modula-2 than on the book itself. Secondly, an entire paragraph on search algorithms has been added. It includes sequential search, binary search, table look-ups and neatly presentations of Knuth-Morris-Pratt and Boyer-Moore string search algorithms. Also a section describing priority search trees completes now the chapter on dynamical data structures. For the reader who is not familiar with the earlier editions, we list below the contents of the book: Chapter 1. Fundamental Data Structures (array, record, set, search algorithms); Chapter 2 Sorting (sorting by insertion, by selection, by exchange, Shellsort, Heapsort, Quicksort, Median finding, Mergesort, Polyphasesort); Chapter 3. Recursive Algorithms (recursive drawings, backtracking algorithms, branch and bound algorithms); Chapter 4. Dynamical Data Structures (pointers, linear lists, trees, binary trees, AVL-trees, search trees, b-trees, priority search trees); Chapter 5. Hashing. It is pointless to outline once again the great qualities of this book, which made out of it one of the most recommended textbooks both for students and experienced programmers.





Describes a project that uses

Uses Software






This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3745241)