C# Example

[Archangel1994]

Hello good folk of the LTT community,

 

I come before you with a quick question. Can someone explain, line by line, what this next segment of C# coding means?

 

public bool IsPrimeNumber(int n)

{

    for (int i = 2; i < n;i++)

        if (n % i == 0)

            return false;

    return true

}

 

So far I know:

 

1. it's a public (always accessible) boolean method called IsPrimeNumber, I don't know what the parameter int n means.

2. int i is 2, the condition is i must be lower than n and if the condition is met then after the instructions i must be increased by 1

3. if n modulus division i (don't know the exact naming in english) is 0 then return false

4. otherwise return true

 

Could someone correct where I am wrong and fill in the missing information and explain how this will show what numbers are prime numbers?

[Archangel1994]

Never mind, I just found out

[MatazaNZ]

Never mind, I just found out

It's good to see you figured it out Always fun working things out when programming.