Execution Flow Closest Pair

[xyzdcgan]

Hi, @ahmedbahaaeldin
I checked your medium post
https://medium.com/@ahmedbahaa944/2d-closest-pair-for-dummies-in-python-divide-and-conquer-c318fa1caf06
And through that I found your code, in which there is some execution/ code issue
I tried to execute but Euclidean_Distance,BruteForceClosestPair,Closest_Pair these function are never called.
Please check
When executed Initial_Sort,mergesort,merge these 3 function are only executed

[ahmedbahaaeldin]

Hello @xyzdcgan , sorry i was really busy.

thank you for following up. Can you check this code now https://github.com/ahmedbahaaeldin/Algorithms-Practice/tree-save/master/General%20Algorithms%20Practice/Divide%20and%20Conquer/Closest%20Pair.py and please remember to replace the initial set of points "P" at the begining of the code with your desired pair of points for it to work. Also the Closest_Pair function at the end of the code is the trigger so remember to make sure it runs cause it had indentation error.