Given the analysis tools of asymptotic complexity measures and recurrence equations in the previous lectures we move to the first algorithmic design paradigm, namely, that of Divide-and-Conquer. We give examples including: merge sort, binary search, exponentiation, Fibonacci sequences, etc. The instruction language is Arabic, however, all the slides, material, formulations, definitions, concepts, etc., are all given in English.
