Design a greedy algorithm which takes as input the number of kids n, and the n lists of intervals [?$, ?$], and outputs the maximum number of kids m that Santa can talk to. You are expected to write the pseudocode of your algorithm.

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter10: Classes And Data Abstraction
Section: Chapter Questions
Problem 19PE
icon
Related questions
Question
On the Christmas eve, Santa Claus will start working to deliver gifts to the lovely kids. Different from previous years that he secretly delivered the gifts, this year, he indeed wants to openly deliver the gifts to the kids and wish them a merry Christmas when delivering the gifts. However, the kids each have very different sleep schedules. Kid i is awake only in a single closed time interval [?$, ?$]. Santa doesn’t want to disturb the sleeping kids, so each time he will find an awake kid, give the gift to the kid, wish the kid a merry Christmas, and talk with the kid until he/she falls asleep. However, Santa does want to meet and talk with as many kids as possible. Design a greedy algorithm which takes as input the number of kids n, and the n lists of intervals [?$, ?$], and outputs the maximum number of kids m that Santa can talk to. You are expected to write the pseudocode of your algorithm.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Time complexity
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning