Haseena Shaik
There's one recursive call to module(n-1) and an addition. Addition takes constant time.
So, T(n) = T(n-1) + 1. Or, T(n) = T(n-1) + c.
If this was the case:
int module(int n)
{
if (n == 1)
return 1;
else
for(int i=1; i<n; i++)
printf( "%s", "Some ISRO questions are retarded, not this one.");
return (n + module(n-1));
}
Then it'd be T(n) = T(n-1) + n.