What is the time complexity of linear search?

Best case O(1). Average case O(n). Worst case O(n). Space complexity is O(1).

Linear search

easy

The only search that assumes nothing about the data - which is why it is still the right answer for a linked list, a stream, or twenty items.

Best O(1)Average O(n)Worst O(n)Space O(1)

Loading the linear search engine…

Halve the search space with every comparison.

Skip in blocks of √n, then scan backwards.

Collisions share a bucket, and load factor is everything.