دانلود کتاب طراحی الگوریتم – یک رویکرد روش شناختی – 150 مشکل و راه حل های تفصیلی

This is a book about algorithmics, and its goal is to teach this field and to help instruc- tors to teach it. Algorithmics is, as generally admitted, “the science and art of designing algorithms to solve a given problem, preferably in minimal time”. Consequently, this book aims at presenting efficient methods to design algorithms—mainly through examples. It is structured according to two rules: • Each chapter is devoted to a methodology of algorithm design, which can be applied to different data structures. For example, the chapter “Dynamic Programming” pro- poses problems on 2D arrays, on trees, on strings, as well as on graphs. As a matter of fact, some problems are proposed in two different chapters since they can be solved in different ways—which is particularly interesting to study.We have taken care for each problem to highlight different aspects of the methodologies: none of the 148 problems is just a rewriting of another one. The particular interest of each problem is shortly described at its beginning. • Each chapter begins by an informal presentation on an example, then gives the techni- cal bases of the methodology, and exposes a complete example. Then follows the main part, composed of detailed problems with their complete solution. Somewhat complex problems are tackled in a progressive manner in order to highlight the constructive process of the analysis leading to the solution. This solution is itself exhaustively de- tailed, concluding in programs written in pseudo-code. We do not give the coding in a specific programming language since the transcription from this pseudo-code into any usual one is generally straightforward. The correctness of all algorithms has been tested through code written by the authors.