public void TestMethod3()
{
RecursiveCalculations rc = new RecursiveCalculations();
var f = rc.FibCheck(5);
Assert.IsTrue(f);
//Pass
}
public void FibCheck()
{
int num = 1;
int actual = num;
actual = RecursiveCalculations.FibCheck(num);
Assert.();
}
public void CanReturnNthFibonacciNum()
{
var nthfibrec = new RecursiveCalculations();
var response = nthfibrec.FibonacciRec(0, 1, 1);
Assert.That(response, Is.EqualTo(2));
}
public void TestMethod2()
{
RecursiveCalculations rc = new RecursiveCalculations();
var f = rc.FactorialRec(5, 1);
Assert.AreEqual(f, 120);
//Pass
}
public void CanCheckHighPrimeTrue()
{
var primecheck = new RecursiveCalculations();
var response = primecheck.PrimeCheckRec(61, 2);
Assert.That(response, Is.EqualTo(true));
}
public void CanCheckPrimeFalse()
{
var primecheck = new RecursiveCalculations();
var response = primecheck.PrimeCheckRec(33, 2);
Assert.That(response, Is.EqualTo(false));
}
public void CanReturnFactorialOfZero()
{
var factorialrec = new RecursiveCalculations();
var response = factorialrec.FactorialRec(0, 1);
Assert.That(response, Is.EqualTo(1));
}
public void CanCheckFibonacciFalse()
{
var fibonaccicheck = new RecursiveCalculations();
var response = fibonaccicheck.FibCheck(18);
Assert.That(response, Is.EqualTo(false));
}
public void TestMethod1()
{
RecursiveCalculations rc = new RecursiveCalculations();
var f = rc.FibocacciRec(0, 5, 1);
Assert.AreEqual(f, 5);
//Fail
//Could not work around the fail. Had no idea what this does.
//Sub needs better documentation.
}
public void FibCheckTest()
{
//Arrange
int num = 56;
bool expected = true;
//Act
bool actual = RecursiveCalculations.FibCheck(num);
//Assert
Assert.AreEqual(expected, actual);
}
public void PrimeCheckRecTest()
{
//Arrange
int num = 7;
int divisor = 2;
bool expected = true;
//Act
bool actual = RecursiveCalculations.PrimeCheckRec(num, divisor);
//Assert
Assert.AreEqual(expected, actual);
}
public void When_FibCheck_Expect_FibonacciNumber()
{
var ans = RecursiveCalculations.FibCheck(13);
Assert.AreEqual(true, ans);
}
public void FibocacciRec()
{
var ans = RecursiveCalculations.FibocacciRec(0, 1, 3);
Assert.AreEqual(3, ans);
}
public void When_FactorialRec_Expect_Factresult()
{
var ans = RecursiveCalculations.FactorialRec(4, 1);
Assert.AreEqual(24, ans);
}
public void When_FibocacciRec_Expect_FibonacciNumber()
{
var ans = RecursiveCalculations.FibocacciRec(0, 1, 3);
Assert.AreEqual(3, ans); //method is returning incorrect value
}
public void PrimeCheckRec()
{
var ans = RecursiveCalculations.PrimeCheckRec(27, 2);
Assert.AreEqual(true, ans);
}
public void FibCheck()
{
var ans = RecursiveCalculations.FibCheck(3);
Assert.AreEqual(true, ans);
}
public void FactorialRec()
{
var ans = RecursiveCalculations.FactorialRec(3, 1);
Assert.AreEqual(6, ans);
}
public void When_PrimeCheckRec_Expect_PrimeNumber()
{
var ans = RecursiveCalculations.PrimeCheckRec(5, 2);
Assert.AreEqual(true, ans);
}
public void Test2()
{
var ans = RecursiveCalculations.FactorialRec(1, 4);
Assert.AreEqual(0, 1);
}
