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; }

Follow Math Help Forum on Facebook and Google+

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: CB

View Tag Cloud