000			a
999			_c30581 _d30581
008			220104b xxu||||| |||| 00| 0 eng d
020			_a9780367228897
082			_a518.1 _bSTI
100			_aStinson, Douglas R.
245			_aTechniques for designing and analyzing algorithms
260			_bCRC Press, _c2021 _aBoca Raton :
300			_axiv, 430 p. ; _bill., _c27 cm
365			_b74.99 _cGBP _d104.60
490			_aChapman & Hall/CRC Cryptography and Network Security Series
504			_aIncludes bibliographical references and index.
520			_aDesign and analysis of algorithms can be a difficult subject for students due to its sometimes-abstract nature and its use of a wide variety of mathematical tools. Here the author, an experienced and successful textbook writer, makes the subject as straightforward as possible in an up-to-date textbook incorporating various new developments appropriate for an introductory course. This text presents the main techniques of algorithm design, namely, divide-and-conquer algorithms, greedy algorithms, dynamic programming algorithms, and backtracking. Graph algorithms are studied in detail, and a careful treatment of the theory of NP-completeness is presented. In addition, the text includes useful introductory material on mathematical background including order notation, algorithm analysis and reductions, and basic data structures. This will serve as a useful review and reference for students who have covered this material in a previous course. Features The first three chapters provide a mathematical review, basic algorithm analysis, and data structures. Detailed pseudocode descriptions of the algorithms along with illustrative algorithms are included. Proofs of correctness of algorithms are included when appropriate. The book presents a suitable amount of mathematical rigor. After reading and understanding the material in this book, students will be able to apply the basic design principles to various real-world problems that they may encounter in their future professional careers.
650			_aAlgorithms, Textbooks
650			_aIntractability and undecidability
942			_2ddc _cBK