Divide and Conquer

View slides in full screen

Some additional material related to this class is the following:

• Binary Search
• Master Theorem(s)
• Sorting algorithms

Exercises

Once you have revised the material from this class, you can try to do the problems from the EDA ProblemSet, section 2 Divide and Conquer.. In particular Exercises 2.9, 2.10, 2.11, 2.12. Those exercises will be solved in class in the Problem class P3.

After this class and/or the Problem class P3 you should also be able to solve the MidTerm EDA Exams from the Collection of Solved Exams where there is some C++ code to complete. As always, the solutions are in the very same pdf.

Important

If you have doubts while solving the above exercises (after studying the material and the Problem class P3) please write me an email as soon as possible (and/or write an email to your instructor of the problem class P3).