# Solved Homework: Question: Little Johnny is extremely fond of watching television. His parents are off for work for the peri…

Little Johnny is extremely fond of watching television. His parents are off for work for the period [S, F), and he wants to make full use of this time by watching as much television as possible: in fact, he wants to watch TV non-stop the entire period [S, F). He has a list of his favorite n TV shows (on different channels), where the i-th show runs for the time period [sifi), so that the union of [si,fi) fully covers the entire time period IS, F) when his parents are away. Little Johnny doesn’t mind switching in the middle of a show he is watching, but is very lazy to switch TV channels, so he wants to find the smallest set of TV shows that he can watch, and still stay occupied for the entire period [S, F). Design an efficient O(n logn) greedy algorithm to help Little Johny.

Greedy Alogrithm for the above problem.

1. Store the start time (si) and end time (fi) in a vector of pairs.
2. Now make a copy of the vector formed and sort the first in increasing order of starting time and the other in increasing order of end time.
3. Now once iterate the vector and find out the show which has the largest duration.
4. Now iterate towards left in the start time vector and take the lowest value whose ending time is greaterthan or equal to current shows starting time and include that show in the set.
5. Similarly iterate towards right in the end time vector and take the largest value whose starting time is lessthan or equal to current shows end time.
6. Repeat the steps 4 and 5 until we reach S in start time vector and F in end time vector.

The algorithm has average run time compolexity of O(n log(n)) due to sorting of vectors.

If any doubt then comment. Hope it helps 😀

Pages (550 words)
Approximate price: -

Help Me Write My Essay - Reasons:

Best Online Essay Writing Service

We strive to give our customers the best online essay writing experience. We Make sure essays are submitted on time and all the instructions are followed.

Our Writers are Experienced and Professional

Our essay writing service is founded on professional writers who are on stand by to help you any time.

Free Revision Fo all Essays

Sometimes you may require our writers to add on a point to make your essay as customised as possible, we will give you unlimited times to do this. And we will do it for free.

Timely Essay(s)

We understand the frustrations that comes with late essays and our writers are extra careful to not violate this term. Our support team is always engauging our writers to help you have your essay ahead of time.

Customised Essays &100% Confidential

Our Online writing Service has zero torelance for plagiarised papers. We have plagiarism checking tool that generate plagiarism reports just to make sure you are satisfied.

Try it now!

## Calculate the price of your order

Total price:
\$0.00

How it works?

Fill in the order form and provide all details of your assignment.

Proceed with the payment

Choose the payment system that suits you most.

HOW OUR ONLINE ESSAY WRITING SERVICE WORKS

Let us write that nagging essay.

By clicking on the "PLACE ORDER" button, tell us your requires. Be precise for an accurate customised essay. You may also upload any reading materials where applicable.

Pick A & Writer

Our ordering form will provide you with a list of writers and their feedbacks. At step 2, its time select a writer. Our online agents are on stand by to help you just in case.

Editing (OUR PART)

At this stage, our editor will go through your essay and make sure your writer did meet all the instructions.