With the term "Algorithm" we characterize any well-defined, finite computational process for solving a problem. It is the driving force and the spirit of every efficient computer program. This book is an attempt to summarize the main concepts related to the systematic study of Algorithms and their design and analysis techniques through a collection of indicative problems and exercises.

The content of the book is structured into eleven chapters, which are divided into four Parts and an Appendix:
Basic Concepts (Chapters 1-2), where the necessary mathematical elements of proof of correctness and analysis of algorithm complexity are presented,
Basic Design Techniques (Chapters 3-5), where the main characteristics of the three design techniques of algorithms are studied: divide and conquer, dynamic programming, and greediness,
Graph Algorithms (Chapters 6-9), which concerns the representation and exploration of directed and undirected graphs, and the main algorithms for computing spanning trees, weighted paths, and flow values in transportation networks and their applications,
Complexity Classes (Chapters 10-11), where the Theory of Computation and complexity classes are introduced, with the help of polynomial reductions, and the techniques of approaching solutions and heuristic solutions to difficult problems,
Appendix, with the main mathematical relationships and definitions, the basic terminology in graphs, and the Abstract Data Types that define the functionality of central data structures.

Each chapter briefly examines the main points of the corresponding theory, presenting detailed characteristic issues. [...]

(from the author's preface)