The following code gives an implementation of linear search algorithm on an array.

public static int search$($int arr$[],$ int x$)$

$\{$

$$ int n $=$ arr.length;

$$ for$($int i $=0$; i $<$ n; i$++)$

$\{$

$$ if$($arr$[$i$]==$ x$)$

$$ return i;

$\}$

$$ return $-1$;

$\}$

What is the time complexity of the above linear search algorithm?