• 3.0K views

Write the test cases on prime number with result ?

Answer : Let the prime number be n…
Total
0
Shares
0
0
0
0

Write the test cases on prime number with result ?

  • Let the prime number be n.
  • Divide the number n by 1 remainder=0 pass.
  • Divide the number n by n remainder=0 pass.
  • Divide the number n by 2 remainder!=0 pass.
  • Divide the number n by up to n-1 and if remainder not equal zero, then it is a prime number.
Prime Number Algorithm

Prime Number Algorithm

Example

[pastacode lang=”markdown” manual=”function%20primeTester%20(n)%20%7B%0A%20%2F%2Ftake%20out%20edge%20case%200%20and%201%0A%20if(n%3C%3D1)%20%0A%20return%20false%3B%0A%20%20%0A%20%2F%2Fgo%20from%203%20since%202%20is%20a%20prime%20number%0A%20for(var%20i%3D3%3B%20i%3Cn%3B%20i%2B%2B)%7B%0A%20%20%20%2F%2Fcheck%20if%20n%20is%20divisible%20by%20i%0A%20%20%20if(n%25i%20%3D%3D%3D0%20)%20%0A%20%20%20return%20false%0A%20%7D%0A%20%0A%20%2F%2Fif%20passed%20all%20out%20test%0A%20return%20true%3B%0A%7D” message=”” highlight=”” provider=”manual”/]
Related Tags
Leave a Reply

Your email address will not be published. Required fields are marked *

You May Also Like