hey some one help me out in calculation O(n)

```
int koodle (int n)
{
int j,k:int x;
if(n%2==0)
for(j=0;j<n;j++)
x+=rand()%2;
else
for(k=0;k<n;k++)
x+=rand()%2;
return x;
}
```

I need to obtain the time complexity of the above matrix transpose algorithm using program step count method.

Thanks for any help I can get on this.