Question: Greedy algorithm A selects a time instance when the maximum number of celebrities are present simultaneously. An ad is scheduled at this time and the
Greedy algorithm A selects a time instance when the maximum number of celebrities are present simultaneously. An ad is scheduled at this time and the celebrities covered by this ad are then removed from further consideration. The algorithm A is then applied recursively to the remaining celebrities. Can somebody help with the pseudocode, please?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
