2.5 - Closest Pair of Points using Divide and Conquer algorithm in O(n log n) time.

Описание к видео 2.5 - Closest Pair of Points using Divide and Conquer algorithm in O(n log n) time.

Given a set of n points in 2 dimension, find the pair of points, such that the euclidean distance between them is the minimum. The trivial algorithm takes O(n^2) time, however, we can solve this in O(n log n) time using Divide and Conquer strategy.

Комментарии

Информация по комментариям в разработке

Похожие видео