- Forum
- General C++ Programming
- Help with a Big O Algorithm
Help with a Big O Algorithm
Algorithm of:
for ( j = 0; j < n; j++ )
{
for ( k = j; k < n; k++ )
{
<some operation>
}
}
will result in a number of iterations of <some operation> given by the expression:
<number of iterations> = n + (n-1) + (n-2) + (n-3) + ........ + (n - n)
Reduce the above series expression to an algebraic expression.
After determining the algebraic expression express the performance in Big O Notation.
for ( j = 0; j < n; j++ )
{
for ( k = j; k < n; k++ )
{
<some operation>
}
}
will result in a number of iterations of <some operation> given by the expression:
<number of iterations> = n + (n-1) + (n-2) + (n-3) + ........ + (n - n)
Reduce the above series expression to an algebraic expression.
After determining the algebraic expression express the performance in Big O Notation.
Topic archived. No new replies allowed.