Suggest books to prepare for the olympiad

Question

Books

Good day, before the Olympiad for schoolchildren in computer science, I would like to read a couple of books covering various sorting and search algorithms, algorithms related to graphs (breadth bypass, etc.), as well as theory (combinatorics, graph theory, etc.). etc.).
Please, advise suitable editions for me. Google did not give me anything good about this ...

Thank you in advance.

Answer 1

Seriously, Cormen “Algorithms. Construction and analysis". If it is simpler, then you can, for example, Menshikov "Programming Olympiad Problems". In the first case, a lot of theory awaits you. In the second - a lot of practice and a little theory.
IMHO, the best option is to first read something simple like the same Menshikov, then Kormen, and then go to codeforces.ru and decide. There is nothing to do without practice at the Olympiads.

Answer 2

In principle, before the Olympiad, I read Okulov, “Programming in Algorithms”. Like norms :) But in general - decide, decide, decide. I decided. When it was not clear, he googled, asked on the forums, analyzed the solutions, and decided again. Helped)

Answer 3

Donald Knuth. The art of programming. 4 volumes

Answer 4

Robert Sedgwick, Kevin Wayne Algorithms in Java
Robert Sedgwick Algorithms in C++. Fundamental Algorithms and Data Structures