Ask Question
3 March, 03:49

assume an int array, candy, stores the number of candy bars sold by a group of children wherecandy[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? a) for (int j=0; j<12; j++) sum + = candy[j]; b) for (int j=0; j<12; j++) candy[j] = sum; c) for (int j=0; j<12; j++) sum = candy[j]; d) for (int j=0; j<12; j++) sum + = [j]; e) for (int j=0; j<12; j++) [j] + = sum;

+3
Answers (2)
  1. 3 March, 06:28
    0
    The first one. Important notice sum should be equal to zero before calculating the total sum.
  2. 3 March, 06:33
    0
    it is A
Know the Answer?
Not Sure About the Answer?
Get an answer to your question ✅ “assume an int array, candy, stores the number of candy bars sold by a group of children wherecandy[j] is the number of candy bars sold by ...” in 📙 Computers & Technology if there is no answer or all answers are wrong, use a search bar and try to find the answer among similar questions.
Search for Other Answers