Question
Develop a greedy algorithm to solve the following problem using the staying ahead pattern: You are compiling a CD for a party. There are n
Develop a greedy algorithm to solve the following problem using the "staying ahead" pattern:
"You are compiling a CD for a party. There are n songs that you are considering including on the CD. Song i has a length li and popularity pi. The CD can have a maximum length of L. How much of each song should be included on the CD to maximize the total popularity of the CD, without exceeding the CD's capacity? You may include fractions of songs. (If you include half of song i, it would contribute a popularity of pi/2 to the CD)"
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Database Systems For Advanced Applications 9th International Conference Dasfaa 2004 Jeju Island Korea March 2004 Proceedings Lncs 2973
Authors: YoonJoon Lee ,Jianzhong Li ,Kyu-Young Whang
2004th Edition
3540210474, 978-3540210474
