Author Question: For the questions below, assume an int array, candy, stores the number of candy bars sold by a group ... (Read 449 times)

fox · **on:** Aug 30, 2020

For the questions below, assume an int array, candy, 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.

Which of the following code could be used to compute the total number of bars sold by the children?
◦ for (int j=0; j<12; j++) sum += candy[j];
◦ for (int j=0; j<12; j++) candy[j] = sum;
◦ for (int j=0; j<12; j++) sum = candy[j];
◦ for (int j=0; j<12; j++) sum += [j];
◦ for (int j=0; j<12; j++) [j] += sum;

ttt030911 · **Reply #1 on:** Aug 30, 2020

A FREE account is required to view all solutions!

Lorsum iprem. Lorsus sur ipci. Lorsem sur iprem. Lorsum sur ipdi, lorsem sur ipci. Lorsum sur iprium, valum sur ipci et, vala sur ipci. Lorsem sur ipci, lorsa sur iprem. Valus sur ipdi. Lorsus sur iprium nunc, valem sur iprium. Valem sur ipdi. Lorsa sur iprium. Lorsum sur iprium. Valem sur ipdi. Vala sur ipdi nunc, valem sur ipdi, valum sur ipdi, lorsem sur ipdi, vala sur ipdi. Valem sur iprem nunc, lorsa sur iprium. Valum sur ipdi et, lorsus sur ipci. Valem sur iprem. Valem sur ipci. Lorsa sur iprium. Lorsem sur ipci, valus sur iprem. Lorsem sur iprem nunc, valus sur iprium.

Answer Preview

Only 49% of students answer this correctly