No label defined (Q3745241)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3980450
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3980450

      Statements

      0 references
      1986
      0 references
      search algorithms
      0 references
      dynamical data structures
      0 references
      Sorting
      0 references
      Recursive Algorithms
      0 references
      Hashing
      0 references
      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.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references