Fair division alice and bob inherited a collection of paintings. however, they will receive it only if the collection can be divided into two parts of exactly equal price. (otherwise, it will be donated to a local art museum.) is the collection divisible into two exactly equal halves? we have to find the answer. the prices of the paintings are provided as an array of integers. for example: int prices [] = {10, 15, 12, 18, 19, 17, 13, 35, 33};

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.

step-by-step explanation:

ddd

i think that you should ask google for the answer to that problem because if we don't know it google does