What is the big$-$Oh running time for finding the largest element in an array?

$O(nlog(n))$

$O(log(n))$

$O(n)$

$O(2n)$