Closest Pair Problem: Difference between revisions

From NovaOrdis Knowledge Base
Jump to navigation Jump to search
No edit summary
 
(2 intermediate revisions by the same user not shown)
Line 1: Line 1:
=External=
=External=
* https://www.coursera.org/learn/algorithms-divide-conquer/lecture/nf0jk/o-n-log-n-algorithm-for-closest-pair-i-advanced-optional
* https://www.coursera.org/learn/algorithms-divide-conquer/lecture/nf0jk/o-n-log-n-algorithm-for-closest-pair-i-advanced-optional
* https://www.coursera.org/learn/algorithms-divide-conquer/lecture/cER7y/o-n-log-n-algorithm-for-closest-pair-ii-advanced-optional
=Internal=
=Internal=
* [[Algorithms#R23wL0|Algorithms | Divide and Conquer]]
* [[Recursive_Algorithms#Divide_and_Conquer|Divide and Conquer Algorithms]]


<center>&#91;[[Algorithms#R23wL0|Next]]]</center>
=Problem=
Given n pair of points in the plane, figure out which points are closest to each other.

Latest revision as of 19:13, 9 November 2021