The difference of time Complexity between given functions can be represented by:
void fun1(int n)
{
for(int i=1;i<=n;i++) for(int j=1;j<=i*i;j++) if(j%i==0) for(int k=1;k<=j;k++) s++; return 0; }
void fun2(int n)
for(int i=1;i<=n;i++) for(int j=1;j<=i*i;j++) for(int k=1;k<=j;k++) s++; return 0; }
$i. O(n^2)$
$ii. O(n)$
$iii.O(1)$
$iv. O(n^{1.5})$
@Shaik MasthanCan u please tell me what is the meaning of difference of time complexity between functions here?
For f1 time complexity see this : https://gateoverflow.in/230638/ace-algorithms
According to me,
for function fun1 complexity is O(n^4) and for fun2 its O(n^5)
hence difference being 0(n)
64.3k questions
77.9k answers
244k comments
80.0k users