Tucil 2 IF2211 Algorithm Strategies: Python implementation to search closest pair of points in d dimensions
-
Updated
Feb 28, 2023 - Python
Tucil 2 IF2211 Algorithm Strategies: Python implementation to search closest pair of points in d dimensions
A Closest Pair of Point Problem Solver, made using the Divide and Conquer approach for the Algorithm and Strategies Course using Python
Shape Side Matching using string matching and similarity
Closest Pair problem solver
Add a description, image, and links to the algorithm-strategies topic page so that developers can more easily learn about it.
To associate your repository with the algorithm-strategies topic, visit your repo's landing page and select "manage topics."