Question: k = n; while( k > 0 ) { for( j = 1; j < n; ++j ) { . . . } k =
k = n;
while( k > 0 )
{
for( j = 1; j < n; ++j )
{
. . .
}
k = k / 3;
}
How do I calculate a big-O behavior?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
