Amdocs Interview Question
write code for detecting wheather a number is prime or not recursivly..
Interview Answer
Anonymous
Jun 22, 2012
int isPrime(int num,int x) { if(x==1) return 1; if(num%x) return isPrime(num,x-1); else return 0; }
write code for detecting wheather a number is prime or not recursivly..
Anonymous
int isPrime(int num,int x) { if(x==1) return 1; if(num%x) return isPrime(num,x-1); else return 0; }
Check out your Company Bowl for anonymous work chats.