Beispielbild für diese ISBN

Introduction to Algorithms, Second Edition

Cormen, Thomas H; Leiserson, Charles E; Rivest, Ronald L; Stein, Clifford

Verlag: McGraw-Hill Science/Engineering/Math, 2001
ISBN 10: 0070131511 / ISBN 13: 9780070131514
Gebraucht / Hardcover / Anzahl: 1
Verkäufer Monarchy books (Toronto, ON, Kanada)
Bei weiteren Verkäufern erhältlich
Alle  Exemplare dieses Buches anzeigen
In den Warenkorb legen
Preis: EUR 32,58
Währung umrechnen
Versand: EUR 5,49
Von Kanada nach USA
Versandziele, Kosten & Dauer

Für später vormerken

Über dieses Buch

Bibliografische Details

Titel: Introduction to Algorithms, Second Edition

Verlag: McGraw-Hill Science/Engineering/Math

Erscheinungsdatum: 2001

Einband: Hardcover

Zustand: Very Good

Auflage: 2nd Edition.


In Very Good Condition 656 Pages With The Index.Large Heavy Books May Need More Payment For Overseas Delivery. Buchnummer des Verkäufers 036397

Über diesen Titel:

Bewertung (bereitgestellt von GoodReads):
4,27 durchschnittlich
(4.401 Bewertungen)

Inhaltsangabe: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Like the first edition, this text can also be used for self-study by technical professionals since it discusses engineering issues in algorithm design as well as the mathematical aspects.

In its new edition, Introduction to Algorithms continues to provide a comprehensive introduction to the modern study of algorithms. The revision has been updated to reflect changes in the years since the book's original publication. New chapters on the role of algorithms in computing and on probabilistic analysis and randomized algorithms have been included. Sections throughout the book have been rewritten for increased clarity, and material has been added wherever a fuller explanation has seemed useful or new information warrants expanded coverage.

As in the classic first edition, this new edition of Introduction to Algorithms presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers. Further, the algorithms are presented in pseudocode to make the book easily accessible to students from all programming language backgrounds.

Each chapter presents an algorithm, a design technique, an application area, or a related topic. The chapters are not dependent on one another, so the instructor can organize his or her use of the book in the way that best suits the course's needs. Additionally, the new edition offers a 25% increase over the first edition in the number of problems, giving the book 155 problems and over 900 exercises that reinforce the concepts the students are learning.

Rezension: Aimed at any serious programmer or computer science student, the new second edition of Introduction to Algorithms 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.

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.

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.

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.

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, The Art of Computer Programming), 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. --Richard Dragan

Topics covered: 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).

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Anbieter- & Zahlungsinformationen


Dieser Anbieter akzeptiert die folgenden Zahlungsarten:

  • American Express
  • Carte Bleue
  • EuroCard/MasterCard
  • PayPal
  • Visa

[Im Angebot des Anbieters suchen]

[Alle Bücher des Anbieters anzeigen]

[Dem Anbieter eine Frage stellen]

Anbieter: Monarchy books
Adresse: Toronto, ON, Kanada

AbeBooks Verkäufer seit: 4. Mai 1999
Bewertung: 4 Sterne


All prices in US Dollars, payable by international Money Order or Credit cards accepted through ABEBOOKS e-commerce, We can accept credit cards directly via Paypal at --

All sales are on first come first served basis with confirmation.
Books will be held for 2 weeks(7 days) pending receipt of payment.
Shipping: $5.50 for 1st book.
$ 2.50 dollars for each additional book ordered on the same order within
North America. Outside North America they will be shipped at cost of at least $...

[Mehr Information]


The books are shipped from the US and Canada. US address orders are shipped from the USA. Canadian orders are shipped from Canada.Orders usually ship within 2 business days. Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or over sized, we may contact you to let you know extra shipping is required.

Anbieterinformationen: Internet based used, old and rare book store. Selling books in the internet since 1998.