Hi everybody,

I need some helpings to calculate time complexity(worst case, best case and average) for following code :

int m = A[0];

for (int i=1;i<n;i++) {if (A*>m) m = A ;}*

int k = 0;

for(int i = 0; i<n;i++) {if(A == m) k++;}

Thank you ........................