NU Learning Resource Center OPAC catalog › Details for: The art of computer programming, volume 3 : sorting ad searching /

Normal view MARC view ISBD view

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

By: Knuth, Donald Ervin [author]Material type: Text

TextPublication details: Boston : Addison-Wesley, c1998Edition: Second editionDescription: xiii, 782 pages : illustrations, 24 cmISBN: 9780201896855Subject(s): ELECTRONIC DIGITAL COMPUTERS -- PROGRAMMING | COMPUTER ALGORITHMSLOC 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.

Average rating: 0.0 (0 votes)

Holdings ( 2 )
Title notes ( 3 )
Comments ( 0 )

Item type	Current library	Home library	Collection	Shelving location	Call number	Copy number	Status	Date due	Barcode
Books	LRC - Main	National University - Manila	Computer Science	General Circulation	GC QA 76.6 .K58 1998 vol.3 c.1 (Browse shelf (Opens below))	c.1	Available		NULIB000006816
Books	LRC - Main	National University - Manila	Computer Science	General Circulation	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.