The art of computer programming: sorting and searching, volume 3 (Record no. 10251)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 03259nam a22002057a 4500 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 240606b |||||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9780201896855 |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.1 |
| Item number | KNU |
| 100 ## - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Knuth, Donald Ervin |
| 245 ## - TITLE STATEMENT | |
| Title | The art of computer programming: sorting and searching, volume 3 |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 2nd ed. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication, distribution, etc. | Boston |
| Name of publisher, distributor, etc. | Addison-Wesley |
| Date of publication, distribution, etc. | 1998 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | xiii, 782p. |
| Other physical details | hb. |
| 500 ## - GENERAL NOTE | |
| General note | https://www.pearson.com/en-us/subject-catalog/p/art-of-computer-programming-the-volume-3-sorting-and-searching/P200000000377/9780201896855?tab=table-of-contents |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming.<br/>–Byte, September 1995<br/><br/>I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasn't in the line-up.<br/>–Charles Long<br/><br/>If you think you're a really good programmer... read [Knuth's] Art of Computer Programming... You should definitely send me a resume if you can read the whole thing.<br/>–Bill Gates<br/><br/>It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers.<br/>–Jonathan Laventhol<br/><br/>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.<br/><br/>5. Sorting.<br/>Combinatorial Properties of Permutations.<br/>Inversions.<br/>Permutations of a Multiset.<br/>Runs.<br/>Tableaux and Involutions.<br/>Internal sorting.<br/>Sorting by Insertion.<br/>Sorting by Exchanging.<br/>Sorting by Selection.<br/>Sorting by Merging.<br/>Sorting by Distribution.<br/>Optimum Sorting.<br/>Minimum-Comparison Sorting.<br/>Minimum-Comparison Merging.<br/>Minimum-Comparison Selection.<br/>Networks for Sorting.<br/>External Sorting.<br/>Multiway Merging and Replacement Selection.<br/>The Polyphase Merge.<br/>The Cascade Merge.<br/>Reading Tape Backwards.<br/>The Oscillating Sort.<br/>Practical Considerations for Tape Merging.<br/>External Radix Sorting.<br/>Two-Tape Sorting.<br/>Disks and Drums.<br/>Summary, History, and Bibliography.<br/><br/>6. Searching.<br/>Sequential Searching.<br/>Searching by Comparison of Keys.<br/>Searching an Ordered Table.<br/>Binary Tree Searching.<br/>Balanced Trees.<br/>Multiway Trees.<br/>Digital Searching.<br/>Hashing.<br/>Retrieval on Secondary Keys.<br/><br/>Answers to Exercises.<br/><br/>Appendix A: Tables of Numerical Quantities.<br/>Fundamental Constants (decimal).<br/>Fundamental Constants (octal).<br/>Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers.<br/><br/>Appendix B: Index to Notations.<br/>Index and Glossary. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer science |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer Programming |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer Algorithms |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | Book |
| Withdrawn status | Lost status | Source of classification or shelving scheme | Damaged status | Not for loan | Collection code | bill no. | bill date | Home library | Current library | Date acquired | Source of acquisition | Cost, normal purchase price | Serial Enumeration / chronology | Total Checkouts | Full call number | Barcode | Date last seen | Cost, replacement price | Price effective from | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Dewey Decimal Classification | Computer science | 118/24-25 | 27/05/2024 | Plaksha University Library | Plaksha University Library | 06/06/2024 | T V Enterprises | 5609.20 | Vol. 3 | 005.1 KNU | 004922 | 06/06/2024 | 4767.93 | 06/06/2024 | Book |