https://info.cours.lecalvar.fr/CM1_reseaux/s5/algo/session5/index.html Duration2h30 Presentation & objectives Many problems can be solved in an algorithmic way. After several decades of searching for efficient algorithmic solutions, some families of techniques have emerged. New problems are usually nothing more than special cases of old and well-known problems. This session will introduce you to a number of existing algorithmic strategies together with the problem solving situations where they apply. You will discover the following techniques: divide and conquer, memoization, dynamic programming, and greedy approaches. Hugo en