Pulse en una miniatura para ir a Google Books.
|
Cargando... The Art of Computer Programming, Volumes 1-4A Boxed Setpor Donald E. Knuth
   Ninguno Actualmente no hay Conversaciones sobre este libro.  antao | Oct 20, 2018 |  sin reseñas | añadir una reseña
Pertenece a las seriesThe Art of Computer Programming (Omnibus 1-4A)
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. No se han encontrado descripciones de biblioteca. |
Debates activosNingunoCubiertas populares 
 Google Books — Cargando...GénerosSistema Decimal Melvil (DDC)005Information Computer Science; Knowledge and Systems Computer programming, programs, data, securityClasificación de la Biblioteca del CongresoValoraciónPromedio: (4.29)
¿Eres tú?Conviértete en un Autor de LibraryThing. |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
1
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])
storeB.set_connections([school])
school.set_connections([storeB, intersection])
intersection.set_connections([school])
visited = []
paths = []
def find_path(start, dest):
visited.append(start)
if start.connections.count(dest) == 1:
print("From ", start, " to ", dest)
print("Found", dest)
visited.append(dest)
paths.append(list(visited))
visited.clear()
else:
for location in start.connections:
if visited.count(location) != 1:
#visited.append(location)
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)):
#print(paths[i])
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 ")
#Output:
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." (