000 | 02671cam a22003978i 4500 | ||
---|---|---|---|
001 | 22599495 | ||
003 | CUTN | ||
005 | 20250531113305.0 | ||
008 | 220531s2023 flu b 001 0 eng | ||
010 | _a 2022025752 | ||
020 |
_a9781032369419 _q(hbk) |
||
020 |
_a9781032369396 _q(pbk) |
||
020 |
_z9781003334590 _q(ebk) |
||
040 |
_aDLC _beng _erda _cDLC |
||
041 | 1 |
_aeng _hfre |
|
042 | _apcc | ||
050 | 0 | 0 |
_aQA9.58 _b.B6713 2023 |
082 | 0 | 0 |
_a518 _223/eng20221128 _bPAT |
100 | 1 |
_aBosc, Patrick, _eauthor. |
|
240 | 1 | 0 |
_aConception d'algorithmes. _lEnglish |
245 | 1 | 0 |
_aAlgorithm design : _ba methodological approach--150 problems and detailed solutions / _cLauren Miclet, Patrick Bosc, & Marc Guyomard. |
250 | _a1st ed | ||
260 |
_aLondon : _bCRC Press , _c2023. |
||
263 | _a2301 | ||
300 |
_a820p. : _bIll ; |
||
500 | _aTranslation of: Conception d'algorithmes / Patrick Bosc, Marc Guyomard, Laurent Miclet. 2016. | ||
504 | _aIncludes bibliographical references and index. | ||
505 | _aTable of Contents Mathematics and Computer Science: Some Useful Notions Complexity of an Algorithm Specifications, Invariants, Iteration Reduce and Conquer, Recursion Generate and Test Branch and Bound Greedy Algorithms Divide and Conquer Dynamic Programming Notations List of Problems. | ||
520 | _aA best-seller in its French edition, the construction of this book is original and its success in the French market demonstrates its appeal. It is based on three principles: 1. An organization of the chapters by families of algorithms : exhaustive search, divide and conquer, etc. At the contrary, there is no chapter only devoted to a systematic exposure of, say, algorithms on strings. Some of these will be found in different chapters. 2. For each family of algorithms, an introduction is given to the mathematical principles and the issues of a rigorous design, with one or two pedagogical examples. 3. For its most part, the book details 150 problems, spanning on seven families of algorithms. For each problem, a precise and progressive statement is given. More important, a complete solution is detailed, with respect to the design principles that have been presented ; often, some classical errors are pointed at. Roughly speaking, two thirds of the book are devoted to the detailed rational construction of the solutions. | ||
650 | 0 |
_aAlgorithms _vProblems, exercises, etc. |
|
700 | 1 |
_aMiclet, Lauren, _eauthor. |
|
700 | 1 |
_aGuyomard, Marc, _eauthor. |
|
906 |
_a7 _bcbc _corignew _d1 _eecip _f20 _gy-gencatlg |
||
942 |
_2ddc _cBOOKS |
||
999 |
_c44513 _d44513 |