Divide and Conquer Closest Pair I Design and Analysis of Algorithms I
Closest Pair I
Feb 22, 2016
Divide and Conquer. Closest Pair I. Design and Analysis of Algorithms I. The Closest Pair Problem. Initial Observations. High-Level Approach. The Divide and Conquer Paradigm. ClosestPair ( ). - PowerPoint PPT Presentation
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Divide and Conquer
Closest Pair IDesign and Analysis
of Algorithms I
Tim Roughgarden
The Closest Pair Problem
Tim Roughgarden
Initial Observations
Tim Roughgarden
High-Level Approach
Tim Roughgarden
The Divide and Conquer Paradigm
Tim Roughgarden
ClosestPair()
𝑂 (𝑛)𝑂 (𝑛 log𝑛)𝑂 ¿𝑂 (𝑛2)
Suppose we can correctly implement the ClosestSplitPair subrouine in time. What will be the overall running time of the Closest Pair algorithm? (Choose the smallest upper bound that applies.)
Tim Roughgarden
ClosestPair()
Tim Roughgarden
ClosestSplitPair(,)
Tim Roughgarden
Correctness Claim
Related Documents
