C implementation of Closest Pair Problem.
-
Updated
Nov 17, 2021 - C
C implementation of Closest Pair Problem.
MPI parallel implementation of bruteforce and divide et impera approaches to the Closest Pair of Points problem
Comparison of sorting algorithms Closest Point and Gharam Scan through OpenMP and MPI
Add a description, image, and links to the closest-pair-of-points topic page so that developers can more easily learn about it.
To associate your repository with the closest-pair-of-points topic, visit your repo's landing page and select "manage topics."