Quote:
Originally Posted by Acessd23  I couldn't solve this one ?
What is the Big O of this function ?
Void two(int n)
{ int i,j,k,n;
for (i=1;i<=n;i++)
for (j=(i+1);j<=n;j++)
for (k=1;k<=j;k++)
o(1) statment;
} |
The loop operations count of the inner most loop is
, so that of the next outer loop is:
ans so for the outermost loop:
![\sum_{i=1}^n \left[ \sum_{j=i+1}^n o(1)j\right]=o(1)\sum_{i=1}^n \left[ \sum_{j=i+1}^n j\right]](http://www.mathhelpforum.com/math-help/latex2/img/ea11d655df7b03541c70c1f4830be6be-1.gif "\sum_{i=1}^n \left[ \sum_{j=i+1}^n o(1)j\right]=o(1)\sum_{i=1}^n \left[ \sum_{j=i+1}^n j\right]")
CB