Open In App
Related Articles

GATE | GATE-CS-2007 | Question 51

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report
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) denotes the number of times the for loop is executed by the program on input n. Which of the following is TRUE? (A) T(n) = O(sqrt(n)) and T(n) = \Omega(sqrt(n)) (B) T(n) = O(sqrt(n)) and T(n) = \Omega(1) (C) T(n) = O(n) and T(n) = \Omega(sqrt(n)) (D) None of the above (A) A (B) B (C) C (D) D

Answer: (B)

Explanation: See Question 5 of https://www.geeksforgeeks.org/data-structures-and-algorithms-set-12/

Quiz of this Question

Last Updated : 28 Jun, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads