https://info.cours.lecalvar.fr/sae-s6/s5/algo/session2/index.html Duration2h30 + preparation Presentation & objectives To solve a problem of a given size, it may be necessary to solve subproblems of smaller sizes, and then to aggregate the intermediate results to get the final result. Recursive algorithms do just that, by describing the operations to perform on a small part of data, before going to the next part through self-call. In this session you will study situations, often characterised by the nature of the data structures, where algorithmic solutions are naturally expressed in a recursive way. Hugo en