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
The Design and Analysis of Computer Algorithms
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
Related products
Sting Magic (Empire of War and Wings #1)
Vikings, War, and the Fall of the Carolingians: A Critical English Translation of the Annals of Saint Vaast
May Bird, Warrior Princess (May Bird, #3)
Kushner, Inc.: Greed. Ambition. Corruption. the Extraordinary Story of Jared Kushner and Ivanka Trump
History of Korea: A Captivating Guide to Korean History, Including Events Such as the Mongol Invasions, the Split into North and South, and the Korean War
The Art of War: War and Military Thought
Bear and Fred: A World War II Story
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"!
André Alsurmi –
this was a very exciting book, i would recommend to my class.
Shwe Yee –
It's an important thing for me It's an important thing for me
Bartczukkuba –
Dino Druding –
Surbhi –
Mikhail V. Evstiounin –
Om Abb –
Jacobsca –
Ankur Shukla –
Ger –
Sanish Sivanandan –
Owen –
Nasir Piya –
mark miller –
Anamika –
Marko Jakovljevic –
Jansi –
Steven –
Karim Fanous –
Perry Ebenezer –
Hamid Zaher –
Christoph Kögl –
Fazee Khan –
Saw –
Siddhartha –
Subhajit Das –
Krun –
Pankaj –
Sayantan Adhikary –