![Avid TV Watcher<br />Problem:<br />There is a TV avid person, who wants to spend his maximum time on TV. There are N channels that telecast programs of different length at different timings. WAP to find the program and channel number so that the person can spend his max time on TV.<br />Algorithm:<br />,[object Object]](https://image.slidesharecdn.com/avidtvwatcher-110304054646-phpapp02/85/avid-tv-watcher-1-320.jpg)
Recommandé
Contenu connexe
Plus de Akash Agrawal
Dernier
Dernier (20)
Avid tv watcher
- 2. n ← length(prog) - 1
- 3. for i ← 1 to n
- 4. do prog[i].cnt ← 0
- 5. max ← 0
- 6. j ← 0
- 7. while prog[j].end < prog[i].start
- 8. if max < prog[j].cnt
- 9. do max ← proj[j].cnt
- 10. j ← j + 1
- 11. do prog[i].cnt ← max + prog[i].end – prog[i].start
- 12. do res ← 0
- 13. for i ← 1 to n
- 14. if res < prog[i].cnt
- 15. do res ← prog[i].cnt
- 16. return resExample:<br />Channel 1:<br />Program idP1P2P3Start time8:009:0010:30End time8:3010:0011:30<br />Channel 2:<br />Program idP4P5P6Start time8:159:3010:45End time9:1510:1511:15<br />Sort all programs based on their end time:<br />Cnt000000Pr idP1P4P2P5P6P3St time8:008:159:009:3010:4510:30End time8:309:1510:0010:1511:3011:30<br />1st Iteration:<br />Cnt00:3000000Pr idP1P4P2P5P6P3St time8:008:159:009:3010:4510:30End time8:309:1510:0010:1511:3011:30<br />2nd Iteration:<br />Cnt00:3001:000000Pr idP1P4P2P5P6P3St time8:008:159:009:3010:4510:30End time8:309:1510:0010:1511:3011:30<br />3rd Iteration:<br />Cnt00:3001:0001:30000Pr idP1P4P2P5P6P3St time8:008:159:009:3010:4510:30End time8:309:1510:0010:1511:3011:30<br />4th Iteration:<br />Cnt00:3001:0001:3001:4500Pr idP1P4P2P5P6P3St time8:008:159:009:3010:4510:30End time8:309:1510:0010:1511:3011:30<br />5th Iteration:<br />Cnt00:3001:0001:3001:4502:300Pr idP1P4P2P5P6P3St time8:008:159:009:3010:4510:30End time8:309:1510:0010:1511:3011:30<br />6th Iteration:<br />Cnt00:3001:0001:3001:4502:3002:45Pr idP1P4P2P5P6P3St time8:008:159:009:3010:4510:30End time8:309:1510:0010:1511:3011:30<br />