The Russian Peasants Multiplication algorithm uses a decrease$-$and$-$conquer strategy to find the product of all entries in an array.

the product of two integers.

the product of two integer powers of $2.$

the product of the largest and smallest entries in an array.