000 | 01228nam a22001937a 4500 | ||
---|---|---|---|
005 | 20250218115625.0 | ||
008 | 250218b |||||||| |||| 00| 0 eng d | ||
020 | _a9788131709832 | ||
040 | _cNational Institute of Technology Goa | ||
082 |
_2005.1 _bKNU/ART |
||
100 | _aKnuth, Donald E | ||
245 | _aThe art of computer programming: sorting and searching: Volume 3 | ||
250 | _a2nd | ||
260 |
_aNew Delhi: _b Pearson, _c 2013 |
||
300 | _axiii, 784p.: 15x20x1; Paperback | ||
520 | _aAbout the book: This is the third volume of the The Art of Computer Programming series. The book is a comprehensive survey of computer techniques for sorting and searching. The treatment of data structures, which is covered in Volume I has been extended to consider both large and small databases and internal and external memories. From Volume II, a revised section on optimum sorting and new discussions of the theory of permutations and of universal handling has been included. | ||
650 |
_2Computer Science Engineering _aComputer Science Engineering; Sorting; Searching; Numerical quantities; Internal, Optimum and External sorting; Sequential and digital searching; Binary, Balanced and multiway trees |
||
942 |
_2ddc _cBK _n0 |
||
999 |
_c5237 _d5237 |