1- Find step count to find time complexity ? int findMax (int *x,int n) { int max = - 1; i=0; while (i x[I+1] &&

1- Find step count to find time complexity ? int findMax (int *x,int n)

{

int max = - 1;

i=0;

while (i

{

if( x[i] > x[I+1] && max < x[i] )

max = x[i] ;

else if ( max < x[I+1] )

max= x[i+1] ;

i=i+2;

}

return max;

}

2- Define best case and worst case.FInd BIg-O in both cases using step count ?

input n

i=1

while i <=n

if n%2==0 then

j=i

while j<=n

print j

j=j+1

i=i+1

These both are c++ codes .Find time complexity step by step in both cases with used formulas and reasons why you used those formulas and if anyone have complete knowledge on time complexity explain every step Thanks.