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

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)

Geek Repo

Github PK Tool

divide-and-conquer algorithms nlogn distance closest-pair-of-points closest-pair minimal perimeter triangle

This repository is not active

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)

divide-and-conquer algorithms nlogn distance closest-pair-of-points closest-pair minimal perimeter triangle

Languages

Language:Python 100.0%