Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,885 questions

51,811 answers

573 users

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

1 Answer

0 votes
function isprime_recursion(n, i) {
    if (i == 1) {
        return 1;
    }
    else {
       if (n % i == 0) {
         return 0;
       }
       else {
         return isprime_recursion(n, i - 1);
       }       
    }
}
 

const n = 23;
 
if (isprime_recursion(n, parseInt(n / 2))) {
    console.log("Prime");
}
else {
   console.log("Not prime");
}
 


  
    
    
/*
run:
    
"Prime"
    
*/

 



answered Jan 17, 2021 by avibootz

Related questions

1 answer 164 views
1 answer 181 views
1 answer 112 views
1 answer 132 views
1 answer 144 views
1 answer 176 views
...