DivideConquer_ClosestPairs

This project explores how many nodes will we cover when merging two parts together.

For more details, please check the problem 2 in week4.pdf.

This is actually a part of homework on Algorithm Analysis & Design.

Fir-lat/DivideConquer_ClosestPairs