Hi,can some one guide how to do this algorithm in c#?

I found this yuo tube to be a very good guide.
Look on wikipedia for pseudocode.
Btw. did you know your prime algoritm can be made 2 times faster, but perhaps you don't need that?

I am interseted in knowing your idea(fast algorithm) ,i willing to learn,any info for me good for gaining expirience.

Hi, Artur, or is this your twin brother?
Look at the for loop in your previous thread.
Don't start it with 2, start with 3. Use if statement to say 2 is prime and return. Now 3 is uneven. Think about what you could do about the increment in the for loop...

Its me,just foresome reason logged on to diff acount,very first one i created and forgot passoword): My main account is ArturLit.On this one by mistake,as all my posts on ArturLit.