Question
A Loading Problem : We are given a set S of n items with weights specified by positive real numbers wi , i=1..n, and a
A Loading Problem: We are given a set S of n items with weights specified by positive real numbers wi , i=1..n, and a truck with load weight capacity specified by a positive real number L. We want to load the truck with as many items as possible without exceeding its load capacity. That is, we want to find a maximum cardinality subset C S such that the sum of the item weights in C does not exceed the truck load capacity L. (a) Briefly describe an O(n) time algorithm to solve this problem if S is given in sorted order. (b) Describe an O(n) time algorithm to solve this problem if S is given in arbitrary unsorted order. [Hint: use median selection and prune-&-search.]
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