000			a
999			_c30594 _d30594
008			220112b xxu||||| |||| 00| 0 eng d
020			_a9789811238529
082			_a518.1 _bKLE
100			_aKlein, Shmuel Tomi
245			_aBasic concepts in algorithms
260			_bWorld Scientific, _c2021 _aHoboken :
300			_axix, 343 p. ; _bill., _c24 cm
365			_b58.00 _cUSD _d79.10
504			_aIncludes bibliographical references and index.
520			_aThis book is the result of several decades of teaching experience in data structures and algorithms. It is self-contained but does assume some prior knowledge of data structures, and a grasp of basic programming and mathematics tools. Basic Concepts in Algorithms focuses on more advanced paradigms and methods combining basic programming constructs as building blocks and their usefulness in the derivation of algorithms. Its coverage includes the algorithms' design process and an analysis of their performance. It is primarily intended as a textbook for the teaching of Algorithms for second-year undergraduate students in study fields related to computers and programming. Klein reproduces his oral teaching style in writing, with one topic leading to another, related one. Most of the classical and some more advanced subjects in the theory of algorithms are covered, though not in a comprehensive manner. The topics include Divide and Conquer, Dynamic Programming, Graph algorithms, probabilistic algorithms, data compression, numerical algorithms and intractability. Each chapter comes with its own set of exercises, and solutions to most of them are appended.
650			_aAlgorithms
650			_aProbabilistic algorithms
650			_aCryptography Intractability
650			_aSpanning trees
942			_2ddc _cBK