4.7 code practice question 2 edhesive i cant figure out the code for this problem csn anyone help me?
1 answer:
Answer:
See Explanation
Explanation:
<em>See attachment for complete question</em>
The programming language is not stated; I'll answer using Python and Java
Python:
low = 56
high = 70
for i in range(low,high+1):
print(i)
Java:
public class PrintOut{
public static void main(String [] args)
{
int low = 56; int high = 70;
for(int i = low; i<=high;i++)
System.out.print(i+" ");
}
}
For both codes, the explanation is:
The code starts by initializing the range of the print out to 56 and 70
Next, the code segment used an iteration that loops through 56 and 70 and print each digit in this range (both numbers, inclusive).
You might be interested in
Answer:
Following are the response to the given question:
Explanation:
The glamorous objective is to examine the items (as being the most valuable and "cheapest" items are chosen) while no item is selectable - in other words, the loading can be reached.
Assume that such a strategy also isn't optimum, this is that there is the set of items not including one of the selfish strategy items (say, i-th item), but instead a heavy, less valuable item j, with j > i and is optimal.
As , the i-th item may be substituted by the j-th item, as well as the overall load is still sustainable. Moreover, because
and this strategy is better, our total profit has dropped. Contradiction.