Time Complexity forTesting if an Integer is Prime

• Unit Computational Step:

  Checking if an integer divides another.
  

• Problem Size:

  The integer to be tested for primality.
  

• Execution Time:

  To check if 31 is prime, we try 2, 3, 4, and 5
  

• Establish Time Complexity Relationship:

  Checking the primality of N has an approximate
  
  Time Complexity = Sqrt(N)

Previous slide

Next slide

Back to first slide

View graphic version