DAA - Unit2
DAA - Unit2
Prepared by
Dr L Josephine Usha
Asst.Professor/CSE
SRM Institute of Science and Technology
Syllabus Outline
• Unit I - Introduction
• Unit II - Divide-and-conquer
• Unit III - Greedy and Dynamic Programing
• Unit IV - Backtracking
• Unit V - Introduction to randomized and approximation algorithm
Complexity
best= average =worst= 2(n-1) comparisons
Closest- pair problem
Closest- pair problem
Closest- pair problem
Convex - Hull Problem
• Finding the smallest convex polygon, that contains ‘n’ given points in the plane.
This algorithm is also known as quick hull because; its operations are same as
quick sort.
Convex - Hull Problem
Convex - Hull Problem
• Quick hull algorithm
Convex - Hull Problem
• Quick hull algorithm
Convex - Hull Problem
• Algorithm’s geometric operations