tailieunhanh - Advanced Algorithms Analysis and Design - Lecture 13: Designing algorithms using Brute Force and Divide & Conquer approaches

Advanced Algorithms Analysis and Design - Lecture 13: Designing algorithms using Brute Force and Divide & Conquer approaches. In this lecture we will cover the following: finding closest pair in 2-D; improved version finding closest pair in 2-D; generalization in 3-D and then n-D; a general Divide and Conquer approach; merge sort algorithm; . |