Code Example Ch 08-2 Assume you have an int array, candy, which stores the number of candy bars sold by a group of children where candy[j] is the number of candy bars sold by child j. Assume there are 12 children in all. -Refer to Code Example Ch 08-2: What does the following method do? public int question15() { Int value1 = 0; Int value2 = 0; For (int j = 0; j value1) { Value1 = candy[j]; Value2 = j; } Return value2; } A) It returns the total number of candy bars sold. B) It returns the total number of children who sold zero candy bars. C) It returns the total number of children who sold more than zero candy bars. D) It returns the number of candy bars sold by the child who sold the most candy bars. E) It returns the index of the child who sold the most candy bars.

Question

Code Example Ch 08-2
Assume you have an int array, candy, which stores the number of candy bars sold by a group of children where candy[j] is the number of candy bars sold by child j. Assume there are 12 children in all.
-Refer to Code Example Ch 08-2: What does the following method do? public int question15()
{
Int value1 = 0;
Int value2 = 0;
For (int j = 0; j < 12; j++)
If (candy[j] > value1)
{
Value1 = candy[j];
Value2 = j;
}
Return value2;
}
A) It returns the total number of candy bars sold.
B) It returns the total number of children who sold zero candy bars.
C) It returns the total number of children who sold more than zero candy bars.
D) It returns the number of candy bars sold by the child who sold the most candy bars.
E) It returns the index of the child who sold the most candy bars.

Quizplus · Accepted Answer

The method iterates through the candy array to find the child who sold the most candy bars (the highest value in the array) and returns their index. Therefore, the best choice is E, as it returns the index of the child who sold the most candy bars.