Hot Best Seller

The Design and Analysis of Computer Algorithms

Availability: Ready to download

With this text, you gain an understanding of the fundamental concepts of algorithms, the very heart of computer science. It introduces the basic data structures and programming techniques often used in efficient algorithms. Covers use of lists, push-down stacks, queues, trees, and graphs. Later chapters go into sorting, searching and graphing algorithms, the string-matchin With this text, you gain an understanding of the fundamental concepts of algorithms, the very heart of computer science. It introduces the basic data structures and programming techniques often used in efficient algorithms. Covers use of lists, push-down stacks, queues, trees, and graphs. Later chapters go into sorting, searching and graphing algorithms, the string-matching algorithms, and the Schonhage-Strassen integer-multiplication algorithm. Provides numerous graded exercises at the end of each chapter. 0201000296B04062001


Compare

With this text, you gain an understanding of the fundamental concepts of algorithms, the very heart of computer science. It introduces the basic data structures and programming techniques often used in efficient algorithms. Covers use of lists, push-down stacks, queues, trees, and graphs. Later chapters go into sorting, searching and graphing algorithms, the string-matchin With this text, you gain an understanding of the fundamental concepts of algorithms, the very heart of computer science. It introduces the basic data structures and programming techniques often used in efficient algorithms. Covers use of lists, push-down stacks, queues, trees, and graphs. Later chapters go into sorting, searching and graphing algorithms, the string-matching algorithms, and the Schonhage-Strassen integer-multiplication algorithm. Provides numerous graded exercises at the end of each chapter. 0201000296B04062001

30 review for The Design and Analysis of Computer Algorithms

  1. 4 out of 5

    Steve Whiting

    This is one of the key foundations of computer science: "Aho, Hopcraft & Ullman" is up there with "Knuth", not only as great works, but as books so important and so well known that the name of the authors is all that is required to identify it. If you're looking for a definitive work that identifies algorithms for recurrent programming tasks, and want to know exactly how efficient each is, this book has the definitive answer, with all the mathematical proofs to back up their assertions; which is This is one of the key foundations of computer science: "Aho, Hopcraft & Ullman" is up there with "Knuth", not only as great works, but as books so important and so well known that the name of the authors is all that is required to identify it. If you're looking for a definitive work that identifies algorithms for recurrent programming tasks, and want to know exactly how efficient each is, this book has the definitive answer, with all the mathematical proofs to back up their assertions; which is unfortunately a bit of a problem, if your maths education was limited, or a few years ago. This is a great reference book to dip into when you have a specific subject to investigate, but it's not one to read cover to cover unless you really like maths; otherwise the many times you encounter something along the lines of "let us assume (abracadabra) which by process of (hocus pocus) shows that (this) is better than (that) and thus (alakazam!) n = x log 3^2", will become a tad wearing. It's unashamedly an academic book - no consideration given to leading you by the hand through problems, just dive straight in and swim or drown. As a result it's extremely terse, and pretty dismally laid out. For non-expert mathematicians, it could really do with an awful lot more explanation, and diagrams, and an awful lot less "by Schwarzenegger's postulate it is obvious that...". I first read this, a "few years" ago, when it was one of the set books on my Computer Science degree course. It's still a tremendous work, but I think my maths must have been an awful lot better in those days. Highly recommended, but with many caveats - this is certainly not "algorithms for dummies"!

  2. 5 out of 5

    André Alsurmi

    this was a very exciting book, i would recommend to my class.

  3. 5 out of 5

    Shwe Yee

    It's an important thing for me It's an important thing for me

  4. 5 out of 5

    Martin Maenza

  5. 4 out of 5

    Bartczukkuba

  6. 5 out of 5

    Dino Druding

  7. 4 out of 5

    Surbhi

  8. 5 out of 5

    Mikhail V. Evstiounin

  9. 4 out of 5

    Liquidlasagna

  10. 4 out of 5

    Om Abb

  11. 5 out of 5

    Jacobsca

  12. 5 out of 5

    Ankur Shukla

  13. 4 out of 5

    Ger

  14. 5 out of 5

    Sanish Sivanandan

  15. 5 out of 5

    Andrew Dunn

  16. 4 out of 5

    Nhung Trịnh

  17. 5 out of 5

    Owen

  18. 4 out of 5

    Nasir Piya

  19. 4 out of 5

    mark miller

  20. 4 out of 5

    Anamika

  21. 5 out of 5

    Marko Jakovljevic

  22. 4 out of 5

    Jansi

  23. 4 out of 5

    Steven

  24. 5 out of 5

    Karim Fanous

  25. 5 out of 5

    Perry Ebenezer

  26. 5 out of 5

    Hamid Zaher

  27. 4 out of 5

    Christoph Kögl

  28. 5 out of 5

    Fazee Khan

  29. 4 out of 5

    Saw

  30. 5 out of 5

    Siddhartha

Add a review

Your email address will not be published. Required fields are marked *

Loading...