This site uses cookies to deliver our services, improve performance, for analytics, and (if not signed in) for advertising. By using LibraryThing you acknowledge that you have read and understand our Terms of Service and Privacy Policy. Your use of the site and services is subject to these policies and terms.
Hide this

Results from Google Books

Click on a thumbnail to go to Google Books.

Art of Computer Programming, Volumes 1-4A…

Art of Computer Programming, Volumes 1-4A Boxed Set, The (3rd Edition)… (edition 2011)

by Donald E. Knuth

MembersReviewsPopularityAverage ratingMentions
1491124,543 (4)1
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. --Byte, September 1995 nbsp; Countless readers have spoken about the profound personal influence of Knuth's work. Scientists have marveled at the beauty and elegance of his analysis, while ordinary programmers have successfully applied his "cookbook" solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books. nbsp; 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. --Charles Long nbsp; Primarily written as a reference, some people have nevertheless found it possible and interesting to read each volume from beginning to end. A programmer in China even compared the experience to reading a poem. nbsp; If you think you're a really good programmer... read [Knuth's] Art of Computer Programming... You should definitely send me a résumé if you can read the whole thing. --Bill Gates nbsp; Whatever your background, if you need to do any serious computer programming, you will find your own good reason to make each volume in this series a readily accessible part of your scholarly or professional library. nbsp; 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. --Jonathan Laventhol In describing the new fourth volume, one reviewer listed the qualities that distinguish all of Knuth's work. [In sum:] detailed coverage of the basics, illustrated with well-chosen examples; occasional forays into more esoteric topics and problems at the frontiers of research; impeccable writing peppered with occasional bits of humor; extensive collections of exercises, all with solutions or helpful hints; a careful attention to history; implementations of many of the algorithms in his classic step-by-step form. --Frank Ruskey These four books comprise what easily could be the most important set of information on any serious programmer's bookshelf.… (more)
Title:Art of Computer Programming, Volumes 1-4A Boxed Set, The (3rd Edition) (Box Set)
Authors:Donald E. Knuth
Info:Addison-Wesley Professional (2011), Edition: 3, Hardcover, 3168 pages
Collections:Home Library, Your library
Tags:Programming Reference

Work details

The Art of Computer Programming, Volumes 1-4A Boxed Set by Donald E. Knuth



Sign up for LibraryThing to find out whether you'll like this book.

No current Talk conversations about this book.

» See also 1 mention

(Original Review, 2011)

Here's my code and a sample run attempting to find the shortest path from "Home" to "School":

class Location:
def __init__(self, name):
self.name = name
self.connections = []

def set_connections(self, connections):
self.connections = connections

def __str__(self):
return self.name

home = Location("Home")
storeA = Location("StoreA")
storeB = Location("StoreB")
school = Location("School")
intersection = Location("Intersection")

home.set_connections([storeA, storeB, intersection])
storeA.set_connections([home, storeB])
school.set_connections([storeB, intersection])

visited = []
paths = []

def find_path(start, dest):
if start.connections.count(dest) == 1:
print("From ", start, " to ", dest)
print("Found", dest)
for location in start.connections:
if visited.count(location) != 1:
print("From ", start, " to ", location)
find_path(location, dest)

find_path(home, school)

minn = len(paths[0])
index = 0
for i in range(len(paths)):
if minn > len(paths[i]):
minn = len(paths[i])
index = i

print("The shortest path is:")
for j in range(len(paths[index])):
print("From ", paths[index][j], " to ")

From Home to StoreA
From StoreA to StoreB
From StoreB to School
Found School
From Home to StoreB
From StoreB to School
Found School
From Home to Intersection
From Intersection to School
Found School
The shortest path is:
From StoreB to
From School to

Question: What Knuth algorithm did I use here?

Bottom-line: Knuth once said something that I still remember to this day (and I follow this dictum to the letter): "Do your own thing and know what you are talking about." ( )
  antao | Oct 20, 2018 |
no reviews | add a review
You must log in to edit Common Knowledge data.
For more help see the Common Knowledge help page.
Series (with order)
Canonical title
Original title
Alternative titles
Original publication date
Important places
Important events
Related movies
Awards and honors
First words
Last words
Disambiguation notice
Publisher's editors
Publisher series
Original language
Canonical DDC/MDS

References to this work on external resources.

Wikipedia in English


No library descriptions found.

Book description
Haiku summary

Quick Links

Popular covers


Average: (4)
1 1
4 1
5 3

Penguin Australia

An edition of this book was published by Penguin Australia.

» Publisher information page

Is this you?

Become a LibraryThing Author.


About | Contact | Privacy/Terms | Help/FAQs | Blog | Store | APIs | TinyCat | Legacy Libraries | Early Reviewers | Common Knowledge | 139,679,748 books! | Top bar: Always visible