Recursive prime number f(x) - C - The Diigo Meta page

• 10 Dec 07
  

  Damon Snyder

  algorithms

  • if (test < 2) return 1;
     if (!(n%test)) return 0;
     return is_prime_helper(n,test-1);

Would you like to comment?

Join Diigo for a free account, or sign in if you are already a member.