Algorithmics [INFOB237]

Learning outcomes

• formalize a problem described informally (specify) ;
• systematically build a correct and efficient program solving this problem.

Objectives

Content

1. divide-and-conquer
2. memoization and dynamic programming
3. the greedy method
4. generate-and-test and its improvements : branch-and-bound, propagation

Table of contents

1. divide-and-conquer
2. memoization and dynamic programming
3. the greedy method
4. generate-and-test and its improvements