public void GreatestCommonDivisor_PositiveSmallPrimes_Returns1() { int a = 5; int b = 3; int actual = EuclidAlgorithm.GreatestCommonDivisor(a, b); int expected = 1; Assert.AreEqual(expected, actual); }
public void GetGCD_Null_ArgumentNullException() { Assert.Throws <ArgumentNullException>(() => EuclidAlgorithm.GetGCD(null)); }
public void GetGCD_Nothing_ArgumentException() { Assert.Throws <ArgumentException>(() => EuclidAlgorithm.GetGCD()); }
public void GetGCD_OneParameter_ArgumentException() { Assert.Throws <ArgumentException>(() => EuclidAlgorithm.GetGCD(28)); }
public void GetGCD_Zeroes_ArgumentException() { Assert.Throws <ArgumentException>(() => EuclidAlgorithm.GetGCD(0, 0, 0, 0, 0, 0)); }
public void GetGCD_ValidNumbers_GCD(int expected, params int[] nums) { int actual = EuclidAlgorithm.GetGCD(nums); Assert.AreEqual(expected, actual); }
public void Setup() { _algorithm = new EuclidAlgorithm(); }
/// <summary> /// Constructor /// </summary> public EuclidAlgorithmTest() { _algorithm = new EuclidAlgorithm(); }