Time Complexity of if inside of for loop

Question

for(int i = 0; i < Array.length ;i++)
{
  ...
 if(s[i]>s[m])
  {m = i;}
 }

What would the time complexity of this algorithm be? O(n)?