big o - 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)?

question from:https://stackoverflow.com/questions/65932089/time-complexity-of-if-inside-of-for-loop

Answer 1

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

Being n the size of the array, and assuming that the computation done in "..." is constant, so let us label the time taken on that "..." as c1, then the time taken with if(s[i]>s[m]) as c2, and m = i as c3. In the worst case-scenario this code has a time complexity of :

n * (c1 + c2 + c3) 

which can be represented by O(n).