Converting Pseudocode to C#

Question

Hi I am new to programming. I am finding it very difficult always did. But I am studying top down design and makes some sense to me. I was reading one example that presented Pseudocode. I have tried so many time to convert it to C# but I keep getting it wrong. Can someone help me convert it to C# to give me a better understanding. Its just for my own benefit. Thank you for any help you can provide. Comment Get the value for N Output: Please enter a positive integer:  Input: N If N Output: N  isn't a perfect number. STOP Endif Comment Initialize sum of the divisors & divison SumOfDivisors Candidate Comment Consider all possible divisors While Candidate R If R = 0 Then SumOfDivisors Endif Candidate Endwhile Comment Check the results If SumOfDivisors = N Then Output: N  is a perfect number. Else Output: N  isn't a perfect number. Endif

Owen · Answer

Thanks very much. I will print both of and compare be a great starting point for me. So much to learn but this helps!

Vulpes · Answer

The following is a direct translation of the pseudo-code to C#: using System; class Program { static void Main() { // Get the value for N Console.Write(Please enter a positive integer: ); int N; int.TryParse(Console.ReadLine() out N); if (N { Console.WriteLine({0} isn't a perfect number N); return; } // Initialize sum of the divisors & divison int SumOfDivisors = 1; int Candidate = 2; // Consider all possible divisors while(Candidate { int R = N - (N/Candidate) * Candidate; if (R == 0) SumOfDivisors += Candidate; Candidate++; } // Check the results if (SumOfDivisors == N) { Console.WriteLine({0} is a perfect number N); } else { Console.WriteLine({0} isn't a perfect number N); } Console.ReadKey(); } } In practice I'd replace this line: int R = N - (N/Candidate) * Candidate; with this: int R = N % Candidate;