Design and Analysis of Algorithms (Divide & Conquer: Convex Hull, Median Finding)
ParadigmGivenaproblemofsizendivideitintosubproblemsofsizen,a≥1,b>1.Solveeachsubproblemrecursively.Combinesolutionsofsubproblemstogettheoverallsolution.T(n)=aT(n/b)+[workformerge]ConvexHullGivennpoints