Amazon cover image
Image from Amazon.com

The art of computer programming, volume 3 : sorting ad searching / Donald Ervin Knuth

By: Material type: TextTextPublication details: Boston, Massachusetts : Addision-Wesley Publishing Company, c1998Edition: Second editionDescription: xiii, 782 pages : illustrations ; 24 cmISBN:
  • 9780201896855
Subject(s): LOC classification:
  • QA 76.6 .K58 1998
Contents:
Chapter 5-Sorting -- Chapter 6-Searching -- Answers to Exercises -- Appendixes -- Index and Glossary.
Summary: The first revision of this third volume is the most comprehensive survey of classical computer techniques for sorting and searching. It extends the treatment of data structures in Volume 1 to consider both large and small databases and internal and external memories. The book contains a selection of carefully checked computer methods, with a quantitative analysis of their efficiency. Outstanding features of the second edition include a revised section on optimum sorting and new discussions of the theory of permutations and of universal hashing.
Item type: Books
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Collection Call number Copy number Status Date due Barcode
Books Books National University - Manila LRC - Main General Circulation Computer Science GC QA 76.6 .K58 1998 vol.3 c.1 (Browse shelf(Opens below)) c.1 Available NULIB000006816
Books Books National University - Manila LRC - Main General Circulation Computer Science GC QA 76.6 .K58 1998 vol.3 c.2 (Browse shelf(Opens below)) c.2 Available NULIB000009396

Includes bibliographical references and index.

Chapter 5-Sorting -- Chapter 6-Searching -- Answers to Exercises -- Appendixes -- Index and Glossary.

The first revision of this third volume is the most comprehensive survey of classical computer techniques for sorting and searching. It extends the treatment of data structures in Volume 1 to consider both large and small databases and internal and external memories. The book contains a selection of carefully checked computer methods, with a quantitative analysis of their efficiency. Outstanding features of the second edition include a revised section on optimum sorting and new discussions of the theory of permutations and of universal hashing.

There are no comments on this title.

to post a comment.