Built something? We create video reels & spotlights for GitHub projects.Promote your project →
Catalog / prupakheti / ClosestPair
Public GitHub Catalog Discovered Sep 29, 2026

prupakheti / ClosestPair

A program that shows comparision between O( n logn) divide and conquer vs O (n ^ 2) brute force solution for finding the closest pair of points from a given set of points.

View repository on GitHub ↗ View creator profile Browse directory

About this discovery

Public repository record indexed from GitHub. Explore verified star velocity metrics, source code repositories, and curated developer tool directories across the GitHubRepo ecosystem.

#14790301GitHub System ID
prupakhetiOrganization / User
PublicVisibility
ActiveCatalog Status

More from prupakheti

↗

prupakheti/EulerTour

DFS based technique for finding the eulerian circuit tour of the given graph.

Discovered
FOR MAINTAINERS

Built something? Put it in front of millions of developers.

We make a short reel about your project and post it across YouTube, Instagram, Threads, and X. Send a link, we do the rest.

SPONSORED Sponsored Partner