000 01959nam a2200241Ia 4500
003 NULRC
005 20250520102819.0
008 250520s9999 xx 000 0 und d
020 _a9781634870214
040 _cNULRC
050 _aQA 76.9 .A76 2015
100 _aArora, Amrinder
_eauthor
245 0 _aAnalysis and design of algorithms /
_cAmrinder Arora
250 _aSecond edition.
260 _a[San Diego, California] :
_bCognella Academic Publishing,
_cc2015
300 _axvii, 140 pages :
_billustrations ;
_c26 cm.
365 _bUSD75.05
504 _aIncludes bibliographical references.
505 _aSection I: The Basics -- Section II: Algorithm Design Techniques -- Section III: Intrinsic Hardiness of Problems -- Section IV: Conclusions and Auxiliary Materials.
520 _aAnalysis and Design of Algorithms provides a structured view of algorithm design techniques in a concise, easy-to-read manner. The book was written with an express purpose of being easy — to understand, read, and carry. It presents a pioneering approach in the teaching of algorithms, based on learning algorithm design techniques, and not merely solving a collection of problems. This allows students to master one design technique at a time and apply it to a rich variety of problems. Analysis and Design of Algorithms covers the algorithmic design techniques of divide and conquer, greedy, dynamic programming, branch and bound, and graph traversal. For each of these techniques, there are templates and guidelines on when to use and not to use each technique. Many sections contain innovative mnemonics to aid the readers in remembering the templates and key takeaways. Additionally, the book covers NP-completeness and the inherent hardness of problems. The third edition includes a new section on polynomial multiplication, as well as additional exercise problems, and an updated appendix.
650 _aCOMPUTER ALGORITHMS
942 _2lcc
_cBK
999 _c16000
_d16000