This well-organized textbook provides the design techniques of algorithms in a simple and straight forward manner.The book begins with a description of the fundamental concepts such as algorithm, functions and relations, vectors and matrices. Then it focuses on efficiency analysis of algorithms. In this unit, the technique of computing time complexity of the algorithm is discussed along with illustrative examples.Gradually, the text discusses various algorithmic strategies such as divide and conquer, dynamic programming, Greedy algorithm, backtracking and branch and bound. Finally the string matching algorithms and introduction to NP completeness is discussed. Each algorithmic strategy is explained in stepwise manner, followed by examples and pseudo code.Thus this book helps the reader to learn the analysis and design of algorithms in the most lucid way.
"synopsis" may belong to another edition of this title.
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand pp. 690. Seller Inventory # 401673170
Quantity: 4 available
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 690. Seller Inventory # 26394703885
Quantity: 4 available
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND pp. 690. Seller Inventory # 18394703879
Quantity: 4 available
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9789333223867
Quantity: Over 20 available
Seller: moluna, Greven, Germany
Condition: New. Seller Inventory # 909517312
Quantity: Over 20 available
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New. Seller Inventory # ABLING22Oct2018170268207
Quantity: Over 20 available
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. Neuware. Seller Inventory # 9789333223867
Quantity: 2 available