A serial search begins with the first array element

A serial search continues searching, element by element, either until a match is found or until the end of the array is encountered

A serial search is useful when the amount of data that must be search is small

For a serial search to work, the data in the array must be arranged in either alphabetical or numerical order

serial

random

parallel

binary

Place reference to them in and array an sort the array

Place them in a linked list and sort the linked list

Place pointers to them in an array and sort the array

Place them in an array and sort the array

1/2 * i (i + 1) j

i + j

i (i + 1) + j

none of these

n/2

(n-1)/2

(n+1)/2

None of these