How to find whether a number is prime or not using recursion in C#

1 Answer

0 votes
using System;

class Program
{
    static bool isprime_recursion(int n, int i) {
        if (i == 1) {
            return true;
        }
        else {
           if (n % i == 0) {
             return false;
           }
           else {
             return isprime_recursion(n, i - 1);
           }       
        }
    }
    static void Main() {
        int n = 23;
      
        if (isprime_recursion(n, n / 2)) {
             Console.Write("Prime");
        }
        else {
             Console.Write("Not prime");
        }
    }
}




/*
run:

Prime

*/

 



answered Jan 16, 2021 by avibootz
edited Jan 16, 2021 by avibootz

Related questions

1 answer 273 views
1 answer 295 views
1 answer 248 views
1 answer 265 views
1 answer 337 views
...