static void Main(string[] args)
{
int N = 15;
Console.WriteLine($"{N}! = {Factorial.CalcFactorial(N)}"); // writes the factorial of variable N
int X = 22;
Console.WriteLine($"{Fibonacci.CalcFibonacci(X)} is the number at place {X} in the Fibonacci sequence.");
}
static void Main(string[] args)
{
Factorial f = new Factorial();
Console.WriteLine("Factorials using recursive method.");
Console.WriteLine("Factorial of 3 is " + f.FactR(3));
Console.WriteLine("Factorial of 4 is " + f.FactR(4));
Console.WriteLine("Factorial of 5 is " + f.FactR(5));
Console.WriteLine();
Console.WriteLine("Factorials using iterative method.");
Console.WriteLine("Factorial of 3 is " + f.FactI(3));
Console.WriteLine("Factorial of 4 is " + f.FactI(4));
Console.WriteLine("Factorial of 5 is " + f.FactI(5));
}
static void Main(string[] args)
{
Console.WriteLine("Choose sub-program to run\n");
Console.WriteLine("(1) Factorial");
Console.WriteLine("(2) Decimal Number Conversions");
Console.WriteLine("(3) Greatest Common Disvisor");
Console.WriteLine("(4) Fibonacci Sequence to n places");
Console.WriteLine("(5) Tower of Hanoi solutions");
Console.WriteLine("(6) Quit");
int s = Convert.ToInt32(Console.ReadLine());
switch (s)
{
case 1:
Factorial f = new Factorial();
f.FactorialCalc();
break;
case 2:
Conversion c = new Conversion();
break;
case 3:
GCD g = new GCD();
break;
case 4:
int p;
Fibonacci fi = new Fibonacci();
break;
case 5:
TowerofHanoi t = new TowerofHanoi();
break;
case 6:
break;
default:
Console.WriteLine("Try Again");
break;
}
}
static void Main(string[] args)
{
Factorial factorial = new Factorial();
BaseConversion baseConversion = new BaseConversion();
GCD gcd = new GCD();
Fibonacci fibonacci = new Fibonacci();
TowerofHanoi towerofHanoi = new TowerofHanoi();
int operationCode = -1;
do
{
Console.Clear();
operationCode = DisplayMenu();
Console.Clear();
switch (operationCode)
{
case 1: // factorial
if (getNumber("1)Single 2)Sequence: ") == 1)
{
int n = getNumber("\nEnter nth factorial: ");
string result = String.Format("Factorial of nth term {0} is {1}.", n, factorial.fac(n));
output(result);
}
else
{
int n = getNumber("\nEnter nth factorial: ");
factorial.facSeq(n);
}
continuation();
break;
case 2: // base conversion
int opcode = getNumber("1)Binary 2)Octal 3)Hexadecimal: ");
if (opcode == 1)
{
baseConversion.toBinary(getNumber("Enter a number: "));
}
else if (opcode == 2)
{
baseConversion.toOctal(getNumber("Enter a number: "));
}
else
{
baseConversion.toHexadecimal(getNumber("Enter a number: "));
}
continuation();
break;
case 3: // gcd
int gcd_num1 = getNumber("Enter first number: ");
int gcd_num2 = getNumber("Enter second number: ");
int gcd_ans = gcd.getGCD(gcd_num1, gcd_num2);
output(String.Format("\nThe Greatest Common Denominator of {0} and {1} is {2}.\n", gcd_num1, gcd_num2, gcd_ans));
continuation();
break;
case 4: // fib
fibonacci.fibSeq(getNumber("Enter number of terms: "));
continuation();
break;
case 5: // hanoi
int disk = getNumber("Number of disks: ");
char source = getChar("\nEnter a letter for source rod: ");
char target = getChar("\nEnter a letter for destination rod: ");
char temp = getChar("\nEnter a letter for auxiliary rod: ");
output("\n");
towerofHanoi.Hanoi(disk, source, target, temp);
continuation();
break;
default:
Console.WriteLine("Action unsucessful: Invalid code!");
break;
}
} while (operationCode != 0);
}
