Explanation

Linear search runs in linear time and makes a maximum of n comparisons, where n is the length of the list.

Hence, the computational complexity for linear search is O(N).