What to read on the theory of algorithms?

Question

Books

Please advise good books on the theory of algorithms for programmers (that is, not too much mathematics). It is necessary to understand such topics as: Complexities of algorithms, classes of complexity, About big, about small. How to correctly determine the running time of the algorithm.
Preferably in Russian, thanks in advance.

Answer 1

The best book (I don't know if it's in Russian) is "Introduction to Algorithms", (Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein)
mitpress.mit.edu/books/introduction-algorithms
PS

for programmers (i.e. not too much math)

very strange and wrong installation, IMHO

Answer 2

In my opinion Cormen "Algorithms: construction and analysis" is the best there is.
e-maxx.ru/bookz/files/cormen.pdf

Answer 3

Here is another good book: "Algorithms. Introduction to Design and Analysis". Author: Anany Levitin.

Answer 4

I also really like McConnell's book, Fundamentals of Modern Algorithms www.ozon.ru/context/detail/id/4937014/ I
recommend it.

Answer 5

I can recommend Steven Skiena's book "Algorithms. Development Guide": www.ozon.ru/context/detail/id/6290126/ Easy
enough to read, bias in programming and applied problems, not mathematics (although you can't do without it). I can’t compare with Kormen (didn’t read it), but in comparison with Knut and Wirth, Skiena is much more pleasant to read.