What's the best algorithm to find a missing number between two sorted numbers?

Question

Okay, so here\'s an example:

We have an array [1, 2, 3, 6, 7, 9, 15]

And we need to find the number that would fit between two numbers if this wer