From 4de991b7a6d0984eadd77341a6ea83ca4dafe2f7 Mon Sep 17 00:00:00 2001 From: Ahmed Nader Date: Fri, 11 May 2018 23:26:43 +0200 Subject: [PATCH] Update README.markdown --- Closest Pair/README.markdown | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Closest Pair/README.markdown b/Closest Pair/README.markdown index 35ea15653..3ce08dd49 100644 --- a/Closest Pair/README.markdown +++ b/Closest Pair/README.markdown @@ -2,7 +2,7 @@ Closest Pair is an algorithm that finds the closest pair of a given array of points By utilizing the Divide and Conquer methodology of solving problems so that it reaches the correct solution with O(nlogn) complexity. -![Given points and we're required to find the two red ones](Closest Pair/Images/1200px-Closest_pair_of_points.png) +![Given points and we're required to find the two red ones](../Closest\ Pair/Images/1200px-Closest_pair_of_points.png) As we see in the above image there are an array of points and we need to find the closest two, But how do we do that without having to compare each two points which results in a whopping O(n^2) complexity?