Commit 9996e0f

committed

Add prime test

1 parent e7e375c commit 9996e0fCopy full SHA for 9996e0f

File tree

+49

-0

lines changed

+49

-0

lines changed

Lines changed: 31 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,31 @@`
	`1`	`+using System;`
	`2`	`+using NUnit.Framework;`
	`3`	`+`
	`4`	`+namespace CodingInterview`
	`5`	`+{`
	`6`	`+ public class Class7`
	`7`	`+ {`
	`8`	`+ public static bool Is_Prime(int number)`
	`9`	`+ {`
	`10`	`+ var prime_status = true;`
	`11`	`+ for(var k = 2;k < Math.Round((decimal)number / 2); k++)`
	`12`	`+ {`
	`13`	`+ if(number % k == 0)`
	`14`	`+ {`
	`15`	`+ prime_status = false;`
	`16`	`+ break;`
	`17`	`+ }`
	`18`	`+ }`
	`19`	`+ return prime_status;`
	`20`	`+ }`
	`21`	`+`
	`22`	`+ [Test]`
	`23`	`+ [TestCase(13, true)]`
	`24`	`+ [TestCase(2000, false)]`
	`25`	`+ public void CheckIsPrime(int input, bool expected_value)`
	`26`	`+ {`
	`27`	`+ Assert.AreEqual(Is_Prime(input), expected_value);`
	`28`	`+ }`
	`29`	`+ }`
	`30`	`+}`
	`31`	`+`

Lines changed: 18 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,18 @@`
	`1`	`+# Task 7`
	`2`	`+# Write a program to check if a number is a prime number`
	`3`	`+`
	`4`	`+def is_prime(number):`
	`5`	`+ prime_status = True`
	`6`	`+ for k in range(2, round(number / 2)):`
	`7`	`+ if number % k == 0:`
	`8`	`+ prime_status = False`
	`9`	`+ break`
	`10`	`+ return prime_status`
	`11`	`+`
	`12`	`+`
	`13`	`+def test_prime_number():`
	`14`	`+ assert is_prime(13)`
	`15`	`+`
	`16`	`+`
	`17`	`+def test_not_prime_number():`
	`18`	`+ assert not is_prime(2000)`

Comments

(0)