Missing Arithmetic number

There is a sequence of numbers representing an arithmetic progression in order. It is given that one of the numbers is missing in the progression. What is the minimum (most efficient) worst case complexity for finding the missing elements?

×

Problem Loading...

Note Loading...

Set Loading...