Ask 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 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;

+5
Answers (2)
  1. 22 March, 10:30
    0
    it is A
  2. 22 March, 10:33
    0
    The first one. Important notice sum should be equal to zero before calculating the total sum.
Know the Answer?
Not Sure About the Answer?
Find 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 the answers seem to be not correct or there’s no answer. Try a smart search to find answers to similar questions.
Search for Other Answers