The sequential search algorithm
A) returns 1 if the value being search for is found, otherwise it returns -1.
B) requires the array to be in ascending ordered.
C) uses a loop to sequentially step through an array, starting with the first element.
D) All of the above

Question

Quizplus · Accepted Answer

The sequential search algorithm uses a loop to sequentially step through an array, starting with the first element, until the value being searched for is found or the end of the array is reached. It does not require the array to be in ascending order and does not return -1 if the value is not found, instead it returns a boolean value indicating whether or not the value was found in the array.

The Sequential Search Algorithm