This is the initial setting:
A museum hire guards to check on the art pieces in a hallway. Each guard has a range of 10 meters. (5 on the right side and 5 on the left. The guard is in the middle) Each art piece has a position that is specified beforehand. The goal is to place as few guards as possible to cover all the art pieces.
Example: I have {1,2,3} the first art piece is 1 meter from the entrance, the second art piece is 2 meters from the entrance etc...
Now we have this Greedy Algorithm given to solve this problem:
Select a range of 10 meters that covers the most art-pieces. The guard's position will be in the middle of this range. Remove the points that correspond to the positions of the art pieces covered by the range. Re-do the same process with the remaining art pieces.
I'm asked to find a set of art-pieces positions i.e: {1,2,3} that will make it impossible to find an optimal solution using that Algorithm.
I thought that putting each pair of art-pieces at a 10 meter distance from each other would cause the Algorithm to not find an optimal solution.