000			01422nam a2200241Ia 4500
003			NULRC
005			20250520100610.0
008			250520s9999 xx 000 0 und d
020			_a9780201896855
040			_cNULRC
050			_aQA 76.6 .K58 1998
100			_aKnuth, Donald Ervin _eauthor
245		4	_aThe art of computer programming, volume 3 : _bsorting ad searching / _cDonald Ervin Knuth
250			_aSecond edition.
260			_aBoston, Massachusetts : _bAddision-Wesley Publishing Company, _cc1998
300			_axiii, 782 pages : _billustrations ; _c24 cm.
365			_bUSD192.53
504			_aIncludes bibliographical references and index.
505			_aChapter 5-Sorting -- Chapter 6-Searching -- Answers to Exercises -- Appendixes -- Index and Glossary.
520			_aThe 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.
650			_aELECTRONIC DIGITAL COMPUTERS -- PROGRAMMING
942			_2lcc _cBK
999			_c9057 _d9057