Art of Computer Programming, Volume 3: Sorting and Searching (2nd Edition)

  • Download 5x Faster
  • Download torrent
  • Direct Download
  • Rate this torrent +  |  -

Torrent info

Name:Art of Computer Programming, Volume 3: Sorting and Searching (2nd Edition)

Total Size: 7.69 MB

Magnet: Magnet Link

Seeds: 0

Leechers: 0

Stream: Watch Full Movie @ Movie4u

Last Updated: 2015-07-29 18:53:57 (Update Now)

Torrent added: 2009-08-18 00:00:00

CyberGhost VPN For Torrents

Torrent Files List

knuth d.e. - the art of computer programming vol. 3 (AW, 1997).djvu (Size: 7.69 MB) (Files: 1)

 knuth d.e. - the art of computer programming vol. 3 (AW, 1997).djvu

7.69 MB


leech seeds

Torrent description

This book forms a natural sequel to the material on information structures in Chapter 2 of Volume 1, because it adds the concept of linearly ordered data to the other basic structural ideas.

The title "Sorting and Searching" may sound as if this book is only for those systems programmers who are concerned with the preparation of general-purpose sorting routines or applications to information retrieval. But in fact the area of sorting and searching provides an ideal framework for discussing a wide variety of important general issues:

* How are good algorithms discovered?
* How can given algorithms and programs be improved?
* How can the efficiency of algorithms be analyzed mathematically?
* How can a person choose rationally between different algorithms for the same task?
* In what senses can algorithms be proved ''best possible''?
* How does the theory of computing interact with practical considerations?
* How can external memories like tapes, drums, or disks be used efficiently with large databases?

Indeed, I believe that virtually every important aspect of programming arises somewhere in the context of sorting or searching!

This volume comprises Chapters 5 and 6 of the complete series. Chapter 5 is concerned with sorting into order; this is a large subject that has been divided chiefly into two parts, internal sorting and external sorting. There also are supplementary sections, which develop auxiliary theories about permutations (Section 5.1) and about optimum techniques for sorting (Section 5.3). Chapter 6 deals with the problem of searching for specified items in tables or files; this is subdivided into methods that search sequentially, or by comparison of keys, or by digital properties, or by hashing, and then the more difficult problem of secondary key retrieval is considered. There searching related to sorting is a surprising amount of interplay between both chapters, with strong analogies tying the topics together. Two important varieties of information structures are also discussed, in addition to those considered in Chapter 2, namely priority queues (Section 5.2.3) and linear lists represented as balanced trees (Section 6.2.3).

Like Volumes 1 and 2, this book includes a lot of material that does not appear in other publications. Many people have kindly written to me about their ideas, or spoken to me about them, and I hope that I have not distorted the material too badly when I have presented it in my own words.

ISBN: 0201896850
Publisher: Addison-Wesley Professional
Date: 04 May, 1998
Author: Donald E. Knuth

related torrents

Torrent name

health leech seeds Size

comments (0)

Main Menu