Algorithms in practice. Zingaro D.

“Algorithms in practice” will teach to solve the most difficult and interesting programmatic problems, as well as develop their own algorithms. Real tasks from international programming competitions are taken as examples for training. You will learn how to classify tasks, correctly select the data structure and choose an algorithm for solving. You will understand that the choice of data structure-whether it is a hash-table, a heap or wood-affects the speed of the program and the effectiveness of the algorithm. You will figure out how to apply recursion, dynamic programming, binary search.

no conditional pseudo -cide, all examples are accompanied by the source code in the language of SI with detailed explanations.