public void FactorialRecTest2(int expected, int input) { RecursiveCalc rec = new RecursiveCalc(); int ans = 1; Assert.Equal(expected, rec.FactorialRec(input, ans)); }
public void FibonacciRecTest1() { RecursiveCalc r = new RecursiveCalc(); int expected = 41; int num1 = 1; int num2 = 2; int numFibs = 3; Assert.Equal(expected, r.FibonacciRec(num1, num2, numFibs)); }
[InlineData(3961680, 1, 7, 15)] // --- This test is designed to FAIL, actual expected number should be 3961681 public void FibonacciRecTest2(int expected, int num1, int num2, int numFibs) { RecursiveCalc r = new RecursiveCalc(); Assert.Equal(expected, r.FibonacciRec(num1, num2, numFibs)); }
public void PrimeCheckRecTest(int primenum, int divisor) { RecursiveCalc r = new RecursiveCalc(); Assert.Throws <DivideByZeroException> (() => r.PrimeCheckRec(primenum, divisor)); }