false 108986 11 Aimed at any serious programmer or computer science student, the new second edition of <I>Introduction to Algorithms</I> builds on the tradition of the original with a truly magisterial guide to the world of algorithms. Clearly presented, mathematically rigorous, and yet approachable even for the math-averse, this title sets a high standard for a textbook and reference to the best algorithms for solving a wide range of computing problems.<p>With sample problems and mathematical proofs demonstrating the correctness of each algorithm, this book is ideal as a textbook for classroom study, but its reach doesn't end there. The authors do a fine job of explaining each algorithm. (Reference sections on basic mathematical notation will help readers bridge the gap, but it will help to have some math background to appreciate the full achievement of this handsome hardcover volume.) Every algorithm is presented in pseudo-code, which can be implemented in any computer language, including C/C++ and Java. This ecumenical approach is one of the book's strengths. When it comes to sorting and common data structures, from basic linked lists to trees (including binary trees, red-black, and B-trees), this title really shines, with clear diagrams that show algorithms in operation. Even if you just glance over the mathematical notation here, you can definitely benefit from this text in other ways.<p>The book moves forward with more advanced algorithms that implement strategies for solving more complicated problems (including dynamic programming techniques, greedy algorithms, and amortized analysis). Algorithms for graphing problems (used in such real-world business problems as optimizing flight schedules or flow through pipelines) come next. In each case, the authors provide the best from current research in each topic, along with sample solutions.<p>This text closes with a grab bag of useful algorithms including matrix operations and linear programming, evaluating polynomials, and the well-known Fast Fourier Transformation (FFT) (useful in signal processing and engineering). Final sections on "NP-complete" problems, like the well-known traveling salesman problem, show off that while not all problems have a demonstrably final and best answer, algorithms that generate acceptable approximate solutions can still be used to generate useful, real-world answers.<p>Throughout this text, the authors anchor their discussion of algorithms with current examples drawn from molecular biology (like the Human Genome Project), business, and engineering. Each section ends with short discussions of related historical material, often discussing original research in each area of algorithms. On the whole, they argue successfully that algorithms are a "technology" just like hardware and software that can be used to write better software that does more, with better performance. Along with classic books on algorithms (like Donald Knuth's three-volume set, <I>The Art of Computer Programming</I>), this title sets a new standard for compiling the best research in algorithms. For any experienced developer, regardless of their chosen language, this text deserves a close look for extending the range and performance of real-world software. <I>--Richard Dragan</I> <p> <B>Topics covered:</B> Overview of algorithms (including algorithms as a technology); designing and analyzing algorithms; asymptotic notation; recurrences and recursion; probabilistic analysis and randomized algorithms; heapsort algorithms; priority queues; quicksort algorithms; linear time sorting (including radix and bucket sort); medians and order statistics (including minimum and maximum); introduction to data structures (stacks, queues, linked lists, and rooted trees); hash tables (including hash functions); binary search trees; red-black trees; augmenting data structures for custom applications; dynamic programming explained (including assembly-line scheduling, matrix-chain multiplication, and optimal binary search trees); greedy algorithms (including Huffman codes and task-scheduling problems); amortized analysis (the accounting and potential methods); advanced data structures (including B-trees, binomial and Fibonacci heaps, representing disjoint sets in data structures); graph algorithms (representing graphs, minimum spanning trees, single-source shortest paths, all-pairs shortest paths, and maximum flow algorithms); sorting networks; matrix operations; linear programming (standard and slack forms); polynomials and the Fast Fourier Transformation (FFT); number theoretic algorithms (including greatest common divisor, modular arithmetic, the Chinese remainder theorem, RSA public-key encryption, primality testing, integer factorization); string matching; computational geometry (including finding the convex hull); NP-completeness (including sample real-world NP-complete problems and their insolvability); approximation algorithms for NP-complete problems (including the traveling salesman problem); reference sections for summations and other mathematical notation, sets, relations, functions, graphs and trees, as well as counting and probability backgrounder (plus geometric and binomial distributions). 931060 1990 Introduction to Algorithms, Second Edition total:192|5:82|4:74|3:27|2:8|1:1| 192 804 361 19 4 0 false false Sat Feb 28 00:00:00 -0800 2009 Tue Mar 03 09:36:57 -0800 2009 Tue Mar 03 09:44:50 -0800 2009 more...]]> 3 0 false false Thu May 14 19:54:30 -0700 2009 Fri May 15 06:43:40 -0700 2009 more...]]> 3 0 false false Thu Dec 13 05:21:08 -0800 2007 Thu Dec 13 12:05:41 -0800 2007 more...]]> 5 0 false false Tue Jan 01 00:00:00 -0800 2002 Fri Nov 30 11:39:36 -0800 2007 Sun Dec 02 10:41:36 -0800 2007 Knuth's Art of Computer Programming series. It's thousands of pages long — a magnum opus still in progress; how could it not be the most desirable source?

My research quickly yielded mixed opinions from t...more...]]> 4 0 false false Tue May 01 00:00:00 -0700 2007 Fri May 25 23:40:47 -0700 2007 Tue Sep 16 06:53:33 -0700 2008 more...]]> 5 0 false false Sat Oct 24 11:15:49 -0700 2009 Sat Oct 24 11:17:41 -0700 2009 4 0 false false Thu Mar 26 16:51:05 -0700 2009 Thu Mar 26 16:51:29 -0700 2009 And it's like, the bible for my people... nerds.]]> 0 0 false false Wed Apr 01 13:37:35 -0700 2009 Wed Apr 01 13:40:16 -0700 2009 4 0 false false Sat Jan 01 00:00:00 -0800 2000 Wed Feb 11 12:40:18 -0800 2009 Wed Feb 11 12:41:13 -0800 2009 4 0 false false Sun Aug 30 20:25:43 -0700 2009 Sun Aug 30 20:29:53 -0700 2009 5 0 false false Sun Sep 21 00:23:49 -0700 2008 Sun Sep 21 00:27:24 -0700 2008 more...]]> 0 0 false false Wed Dec 10 21:20:24 -0800 2008 Sat May 23 18:32:59 -0700 2009 4 0 false false Sun Apr 01 11:10:55 -0700 2007 Sun Apr 01 11:12:13 -0700 2007 Amazon.com page for the book and respond to comments. ]]> 5 0 false false Wed Jan 01 00:00:00 -0800 2003 Tue Mar 04 19:58:52 -0800 2008 Tue Mar 04 20:00:38 -0800 2008 4 0 false false Thu Apr 17 11:54:26 -0700 2008 Thu Apr 17 11:54:26 -0700 2008 4 0 false false Tue May 22 07:33:03 -0700 2007 Tue May 22 07:33:33 -0700 2007 0 0 false false Sat Jun 28 10:01:46 -0700 2008 Sat Jun 28 10:02:36 -0700 2008 5 0 false false Fri Jul 06 02:21:03 -0700 2007 Fri Jul 06 02:21:15 -0700 2007 0 0 false false Sun Aug 24 08:40:02 -0700 2008 Sun Aug 24 08:40:23 -0700 2008 0 0 false false Sat Nov 14 18:20:03 -0800 2009 Sat Nov 14 18:20:15 -0800 2009 http://www.goodreads.com/book_link/follow/8?book_id=108986