- Shopping Bag ( 0 items )
From Barnes & NobleThe Barnes & Noble Review
“No pain, no gain” does not have to apply to data structures and algorithms. In the long-awaited Second Edition of Data Structures & Algorithms in Java, Robert Lafore proves once again that you can learn this stuff in English -- without compromising your ability to make the most of it.
Lafore brings a strong practical focus to arrays, sorts, stacks, queues, linked lists, recursion, trees, hash tables, heaps, graphs, and other essential topics. He shows how every technique works, when to use it, and how it looks in real Java code. (Of which there’s plenty -- including “Workshop applets” on the Web that go even further toward illuminating his explanations.)
Much of the code, first published in 1998, has been revamped to reflect Sun’s latest releases -- and five years' more experience with Java. Plenty of new topics are covered, too: depth-first-search and game simulations; Huffman codes for data compression; the classic “Traveling Salesman” problem and “Knight’s Tour” puzzle; Floyd’s and Warshall’s algorithms; 2-3 trees; radix sorts, and more. Finally, new programming projects and end-of-chapter questions make this book a complete hands-on course.
Lafore’s focus is on making sure you walk away with a strong understanding of how data structures and algorithms really work. So he only briefly alludes to Java’s built-in data structure classes (Vector, Stack, Hashtable, et al.). That’s about all that’s missing, though. And you’ll have the consolation of knowing that you understand data structures and algorithms well enough to use them anywhere -- in Java or whatever language comes next. Bill Camarda
Bill Camarda is a consultant, writer, and web/multimedia content developer. His 15 books include Special Edition Using Word 2000 and Upgrading & Fixing Networks For Dummies®, Second Edition.