package com; public class CPrime { public int isPrime(int num) { for(int i=2; i<=num/2; i++) { if(num%i==0) { return 1; } } return 0; } }
Note: (Restricted functionality due to obvious reasons!)
For Mobile-Ease ⇓
Enable
package com; public class CPrime { public int isPrime(int num) { for(int i=2; i<=num/2; i++) { if(num%i==0) { return 1; } } return 0; } }
Minimal Code ( Raw-View ) :
package com; public class CPrime { public int isPrime(int num) { for(int i=2; i<=num/2; i++) { if(num%i==0) { return 1; } } return 0; } }