Converting pseudocode to C#

Tom Drayton

6y4.6k

Does anyone know how to translate the pseudocode below into proper C# code. It is for a forms application where the program outputs all prime numbers between two integer values that are inputed into text boxes. Thanks in advance .

Begin

Clear list box
Initialise num1 and num2
Initialise noPrimes
Validate num1 and num2 as integers (exit if invalid)
If (num1 > num2)
exit
End if
For i = num1 to num2
Initialise count
For j = 2 to (square root of i)
If j is a factor i
Count++
Break out of inner for loop
End if
Next j
If count = 0
Increment noPrimes
Output i as a prime number
End if
Next I
Output the number of primes to the status bar

End

The forms application looks like this

3 Replies

Know the answer? Post it — somebody with the same question will find it here.

Rajanikant Hawaldar6y ago
Hello Tom Drayton, please generate click event and add below code it works perfect as your need, let me know if have any concerns
private void Calculate_Click(object sender, EventArgs e)
{
           listBox1.Items.Clear();

           int num1, num2;
           int noPrimes=0;

           num1 =int.Parse(textBox1.Text);
           num2 =int.Parse(textBox2.Text);
           //this condition i added to avoid zero divide by exception
           if (num1 < 2)
               return;

           if (num1 > num2)
               return;

           for (int i = num1; i <= num2; i++)
           {
               int count=0;
               for (int j = num1; j <=num2; j++)
               {
                   if (i != j && i % j == 0) // i added this extra i != j
                   {
                       count++;
                       break;
                   }

               }
               if (count == 0)
               {
                   noPrimes++;
                   listBox1.Items.Add(i); // binding prime numbers to listbox
                   //count = 0;
               }
           }
           StatusbarText.Text = Convert.ToString(noPrimes);// it's status bar first button
}
+1
Avnish Kumar6y ago
try this:
public partial class Form1 : Form
   {
       public Form1()
       {
           InitializeComponent();
       }

       private void button1_Click(object sender, EventArgs e)
       {
           //            Begin
           listBox1.Items.Clear(); //Clear list box
           int num1 = 0; int num2 = 0; //Initialise num1 and num2
           int noPrimes = 0; //Initialise noPrimes
           if (Regex.IsMatch(textBox1.Text, @"^\d+$") || Regex.IsMatch(textBox2.Text, @"^\d+$")) //Validate num1 and num2 as integers(exit if invalid)
           {
               num1 = Convert.ToInt32(textBox1.Text);
               num2 = Convert.ToInt32(textBox2.Text);
           }
           else
           {
               this.Close();
           }
           if (num1 > num2)// If(num1 > num2)
           {
               this.Close();  //exit
           }//End if
           for (int i = num1; i <= num2; i++)//For i = num1 to num2
           {
               int count = 0;  //Initialise count
               for (int j = 2; j <= Math.Sqrt(i); j++)  //For j = 2 to(square root of i)
               {
                   if (i % j == 0)//If j is a factor i
                   {
                       count++;//Count++
                       break;//Break out of inner for loop
                   }   //End if
               }//Next j
               if (count == 0) //If count = 0
               {
                   noPrimes++;//Increment noPrimes
                   listBox1.Items.Add(i);//Output i as a prime number
               }//End if
               //Next I
           }
           toolStripStatusLabel1.Text = "number of primes " + noPrimes.ToString();
           //Output the number of primes to the status bar
           //End

       }
   }
+1
Vinay Singh6y ago
Hi I dont thinlk show there is any tool to conver it. But just check the below lnik this may help you

https://www.youtube.com/watch?v=H4LfAsOeYQo
0