GitHub - j3meshenry/ClosestPairofPointsAlgorithm: Used recursion and Divide and Conquer to find the closest pair of points in a dataset. Applied the Master Theorem for time complexity analysis, achieving O(n log n) runtime. The program calculates Euclidean distance, processes input files, and uses sorting, all with O(n log n) complexity

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
inputfile1.txt		inputfile1.txt
inputfile2.txt		inputfile2.txt
main.cpp		main.cpp

About

Used recursion and Divide and Conquer to find the closest pair of points in a dataset. Applied the Master Theorem for time complexity analysis, achieving O(n log n) runtime. The program calculates Euclidean distance, processes input files, and uses sorting, all with O(n log n) complexity

algortihms