Hooray! You have added the first book to your bookshelf. Check it out now!
Create your own shelf sign up
[−]
  • Search Digit-count Valid ISBN Invalid ISBN Valid Barcode Invalid Barcode

Introduction to Algorithms, Second Edition

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

(210)

| Paperback | 9780262531962

Like Introduction to Algorithms, Second Edition ?
Join aNobii to see if your friends read it, and discover similar books!

Sign up for free

Book Description

PLEASE NOTE: This is the international student paperback edition of this book. The MIT Press does not have sales rights for this paperback edition in the US and Canada. Customers in the US and Canada must order the hardcover edition.
Continue

PLEASE NOTE: This is the international student paperback edition of this book. The MIT Press does not have sales rights for this paperback edition in the US and Canada. Customers in the US and Canada must order the hardcover edition.

There are books on algorithms that are rigorous but incomplete and others that cover masses of material but lack rigor. Introduction to Algorithms combines rigor and comprehensiveness.

The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.

The first edition became the standard reference for professionals and a widely used text in universities worldwide. The second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning.

12 Reviews

Login or Sign Up to write a review
  • 1 person finds this helpful

    This book is like an encyclopedia of algorithms. The algorithms are presented with pseudo code so it doesn’t matter what your favorite programming language is. A very rigorous mathematical approach is used for the analysis of for instance performance ...(continue)

    This book is like an encyclopedia of algorithms. The algorithms are presented with pseudo code so it doesn’t matter what your favorite programming language is. A very rigorous mathematical approach is used for the analysis of for instance performance.

    Is this helpful?

    Ivan Idris said on Dec 27, 2011 | Add your feedback

  • 1 person finds this helpful

    每個句子都好長....看了有點不耐煩噫
    20120213 看久看習慣了就覺得有所收穫...有點愛上了呢

    Is this helpful?

    哩咖咖 said on Nov 5, 2011 | Add your feedback

  • 1 person finds this helpful

    My personal library about Algorithms and Data Structures.

    "Algorithms and Data Structures" is a huge field.
    Lot of algorithms and data structures are used in nowadays computer software of variuos kinds. Not all data structures or algorithms on them are adequate for solving a particular problem, so you must ...(continue)

    "Algorithms and Data Structures" is a huge field.
    Lot of algorithms and data structures are used in nowadays computer software of variuos kinds. Not all data structures or algorithms on them are adequate for solving a particular problem, so you must have some skills to say which one is "better" than another in your particular situation. Despite it's name, this book is an almost complete reference to achieve this skills. Sure, material presented here is not so easy and the book is not something you can read while watching MTV. Each chapter presents an argument in a very concise and formal way. Too much for some people, but this is not bad. Just skipping what you don't/want understand is the primary key to appreciate this book. When you will master the main concepts of the argument you are interested, it's a pleasure returning on those parts you have precedently skipped.
    Parts about sorting and selections (heapsort, quicksort, linear sorting, etc.), common data structures (stacks and queues, hash tables, search binary trees, red-black trees), advanced data structures (B trees, binomial heaps, Fibonacci's heaps etc.) and algorithms on graphs (depth first traversal, minimum set cover, Kruskal and Prim's algorithms, Bellman-Ford's method, Dijkstra's algorithm) are well written and you can consider this parts as a reference for the future.
    But this book as bad things too. The pseudocode, even if comprehensible, is not so much readable. In some cases it's too much dependent by the contest and this increase your understanding time. Chapters about math reference are not clear at all. Too much arguments without too much explanations, especially sections about algorithm's analisys. The last part of this book about complements and extensions could be easily dropped off from the book. Material presented here don't fit in an introductory text about algorithms and needs other knowledge a person who is reading this book obviously don't has.
    A note on what that particular data structure is useful for would be very appreciated. Good book. Well spent money.

    Is this helpful?

    Renato Perini said on Jul 7, 2011 | Add your feedback

  • 1 person finds this helpful

    Un vangelo dei programmatori, assolutamente il testo di riferimento per il tema algoritmi e strutture dati!

    Is this helpful?

    bznein said on Jan 22, 2010 | Add your feedback

  • 1 person finds this helpful

    Il "Cormen" è usato da gran parte dei corsi universitari di algoritmi e strutture dati. Si tratta di un testo rigoroso, preciso, complesso e ricco di esercizi (da evitare se ci si vuole dedicare all'argomento a tempo perso).
    Peccato per l'orribile ps ...(continue)

    Il "Cormen" è usato da gran parte dei corsi universitari di algoritmi e strutture dati. Si tratta di un testo rigoroso, preciso, complesso e ricco di esercizi (da evitare se ci si vuole dedicare all'argomento a tempo perso).
    Peccato per l'orribile pseudo-linguaggio utilizzato per codificare gli esempi, uno pseudo-pascal, con stranezze tipo la notazione attributo[oggetto].

    Is this helpful?

    Rudolone said on Jan 7, 2010 | Add your feedback

Book Details

  • Rating:
    (210)
    • 5 stars
    • 4 stars
    • 3 stars
  • English Books
  • Paperback 1184 Pages
  • ISBN-10: 0262531968
  • ISBN-13: 9780262531962
  • Publisher: The MIT Press
  • Publish date: 2001-09-01
  • Dimensions: 322 mm x 1,289 mm x 1,483 mm
  • Also available as: Hardcover
  • In other languages: other languages 繁體書 , 简体书 , Libri Italiani
Improve_data of this book