Write a sequential search of an array of integers, assuming that the array is sorted into ascending

Question:

Write a sequential search of an array of integers, assuming that the array is sorted into ascending order. Consider an array that contains the four integers 2, 4, 6, and 8. How can you tell that 5 is not in the array without comparing 5 to every integer in the array?

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Question Posted: