Skip to content

Given an array consisting of n distinct points[p1[x1, y1] ... pn[xn, yn]]. Find the closest pair of points using a Divide-and-Conquer Algorithm with asymptotic complexity of O(N log N)

Notifications You must be signed in to change notification settings

SlavkoPrytula/Find-The-Closest-Pair-Of-Points

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 

About

Given an array consisting of n distinct points[p1[x1, y1] ... pn[xn, yn]]. Find the closest pair of points using a Divide-and-Conquer Algorithm with asymptotic complexity of O(N log N)

Topics

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages