The art of computer programming, volume 3 : sorting ad searching / Donald Ervin Knuth
Material type:
- 9780201896855
- QA 76.6 .K58 1998

Item type | Current library | Home library | Collection | Call number | Copy number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|---|---|
![]() |
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 | ||
![]() |
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 |
Browsing LRC - Main shelves, Shelving location: General Circulation, Collection: Computer Science Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
GC QA 76.6 .K58 1998 vol.2 c.1 The art of computer programming, volume 2 : seminumerical algorithms / | GC QA 76.6 .K58 1998 vol.2 c.2 The art of computer programming, volume 2 : seminumerical algorithms / | GC QA 76.6 .K58 1998 vol.3 c.1 The art of computer programming, volume 3 : sorting ad searching / | GC QA 76.6 .K58 1998 vol.3 c.2 The art of computer programming, volume 3 : sorting ad searching / | GC QA 76.6 .K58 2011 vol.4 c.2 The art of computer programming : combinatorial algorithms, part I / | GC QA 76.6 .S55 2014 Introduction to computational science : modeling and simulation for the sciences / | GC QA 76.6 .S78 2013 c.2 Understanding computation / |
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.