(n + 1)/2

log₂n

n(n + 1)/2

n²

Linear time

Logarithmic time

Constant time

Quadratic time

(n+1)/2

n (n + 1)/2

log(n/2)

n²

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