English version is in beta. All contents of the site should be already translated (mostly using machine translation), and everything should work properly. However, if you find any problems, please contact me.

Level 4B

To advance to the next level, you need to solve all problems.

Sorting

Quadratic sorting algorithms: one, two (you need the simplest bubble sort, insertion sort and selection sort)

Dynamic programming: classical problems

There are a number of classic dynamic programming problems that it would be good to know by heart. Think on them, and you can find the algorithms on the internet if you can't come up with an algorithm yourself. Just make sure that you do not blindly copy code, but that you understand how and why the dynamic programming works in each problem.

Dijkstra's algorithm

Theory: one, two (try to understand why the algorithm requires positive weights!)
algoprog.ru © Petr Kalinin, GNU AGPL, github.com/petr-kalinin/algoprog | About the license for the site materials | Blog (in Russian)