Answer:
The way to solve this question is find the length of the array and then divide it by 2. If the modulus is 0, the number is even, and the collection is divisible. Otherwise, if the modulus is 1, the number is odd, the collection is not divisible and will be donated to a local art museum.
Step-by-step explanation:
The way to solve this question is find the length of the array and then divide it by 2. If the modulus is 0, the number is even, and the collection is divisible. Otherwise, if the modulus is 1, the number is odd, the collection is not divisible and will be donated to a local art museum.
In this case:
int prices [] = {10, 15, 12, 18, 19, 17, 13, 35, 33};
The array has 9 elements, and 9%2 = 1, so it is not divisible into two equal parts.
