AP
Uploaded byAnanthi Palanisamy
91 views
DAA : Brute Force and Divide & Conquer.pdf
Brute Force:Selection and Bubble Sort, Sequential search and String Matching - closest pair and convex hull problem. Divide and Conquer: Merge sort - Quick sort - Binary tree traversals and related properties - Multiplication of large integers and Strassen’s Matrix Multiplication - closest pair and convex hull problem
