PA of Algorithms Q53

0. Consider the following C code segment:

int IsPrime(n)
{
int i, n;
for(i = 2; i < = sqrt(n); i ++)
{
if(n% i = = 0)
printf ("Not Prime\n");
return 0;
}
return 1;
}
Let T(n) denote the number of times the for loop is executed by the program on input n. Which of the following is TRUE?

Answer
Comment
Array

Option : B
Explanation :
Upper bound may be √n times it gets executed. Lower bound may be that if gets executed only once or twice.

You must be logged in to post a comment.

You must be logged in to post a comment.

Forgot your password?

I agree with the Terms.