Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the design of algorithms using the divide and conquer approach, focusing on the Tri Fusion sorting method. It explains the recursive decomposition and merging of sorted lists. Additionally, it introduces dynamic programming, illustrating its application in solving problems with repetitive structures and the calculation of binomial coefficients.