Question: Your boss comes up with the following idea: Move the store closer to the customers' locations to improve sales. He suggests analyzing the current customer address data to select a location from m potential sites such that it has the most customers within a radius of R miles from the store.
Let us assume that both the customer location data and the potential sites are in the form of (x,y) co-ordinates. Let us say there are n customer households.
Write the algorithm and find out the time complexity for the algorithm (in terms of n and m). Note that given two locations (x1, y1) and (x2, y2), distance between them can be calculated by the subsequent formula: ? (x2 - x1)2 + (y2 - y1)2.
Can you find the time complexity and can someone help me with this?