Binary search can be used to efficiently find the number of coins in a sorted array.

• Start by setting low to 0 and high to the length of the array minus 1.

• While low is less than or equal to high, calcu...read more