Skip to content

gosandhya/closest-pair-algorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Closest Pair Algorithm

Closest Pair Algorithm is a Brute-Force algorithm that computes the distances between all pairs of points and then pick the pair with the smallest distance. I have implemented this algorithm as part of my classwork.

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages