algorithms

A very good course of algorithmics. The authors, starting from the simplest problems (algorithms on numbers, primitives and distribution on factors), discussed in it, among others divide and conquer algorithms, sort and find median, fast Fourier transform, and data structures and graphs.

In a novel way, the book describes dynamic programming and linear programming (intuitive understanding of symplex algorithm, duality and reduction to the basic problem). It also presents ways to solve NP-complete problems using searchable greedy and local search algorithms.

The last chapter describes quantum algorithms. The authors make a brief introduction to quantum physics, which will allow the reader to understand this chapter also to those who were previously unknown.