Design and Analysis of Algorithms 18CS42 DAA Module-2 Notes pdf

Design and Analysis of Algorithms Notes 18CS42 for CSE 4th SEM


Divide and Conquer General method, Binary search, Recurrence equation for divide and conquer, Finding the maximum and minimum (T2:3.1, 3.3, 3.4), Merge sort, Quick sort (T1:4.1, 4.2), Strassen’s matrix multiplication (T2:3.8), Advantages and Disadvantages of divide and conquer.

Decrease and Conquer Approach:

Topological Sort. (T1:5.3).

Leave a Comment