Algorithms in Practice. Solving Real Problems

«Algorithms in Practice» will teach you how to solve the most difficult and interesting programming tasks, as well as develop your own algorithms. Real tasks from international programming competitions are taken as examples for learning. You will learn how to classify tasks, correctly choose data structures, and select algorithms to solve them. You will understand that the choice of data structure — be it a hash table, heap, or tree — affects the execution speed of the program and the efficiency of the algorithm. You will figure out how to apply recursion, dynamic programming, and binary search.

No conditional pseudocode, all examples are accompanied by source code in C with detailed explanations.