IT1004 DESIGN AND ANALYSIS OF ALGORITHMS
UNIT III-DIVIDE AND CONQUER
Divide and conquer - Merge Sort – Quick sort – Binary search – Binary search tree traversal - Strassen’s matrix multiplication - Algorithms for the Closest-Pair and Convex-Hull Problems.
Views: 3530
Added: 4 years ago
Unit-III Theory.pdf
Download
Suggested Creators
Answer the Question