PHAct1
Create a complete C# program that will compute for the minimum number of moves based on the inputted number of disks. Provide its equivalent flowchart and pseudocode.
Act2
Create a complete C# program that will find the nth Fibonacci number. Use the formulas in finding the odd and even fibonacci number. Provide its equivalent flowchart and pseudocode.
Act3
Create a complete C# program that will determine the Greatest Common Divisor (GCD) or two inputted integers. Provide its equivalent flowchart and pseudocode.
Create a complete C# program that will compute for the minimum number of moves based on the inputted number of disks. Provide its equivalent flowchart and pseudocode.
Act2
Create a complete C# program that will find the nth Fibonacci number. Use the formulas in finding the odd and even fibonacci number. Provide its equivalent flowchart and pseudocode.
Act3
Create a complete C# program that will determine the Greatest Common Divisor (GCD) or two inputted integers. Provide its equivalent flowchart and pseudocode.