Advanced Algorithms Analysis and Design - Lecture 14: Designing algorithms using Divide & Conquer approach. In this lecture we will cover the following: a general divide and conquer approach; merge sort algorithm; finding maxima in 1-D, and 2-D; finding closest pair in 2-D; . |