123456789101112131415161718192021222324252627282930313233343536
class Solution {
public:
// Main method for testing the checkPrime function
int main() {
Solution solution;
int num = 7;
bool result = solution.checkPrime(num);
cout << (result ? "Prime" : "Not Prime") << endl;
return 0;
}
bool checkPrime(int num) {
// 0 and 1 are not prime numbers
if (num <= 1) {
return false;
}
// Call the helper function to check for primality
return prime(num, 2);
}
private:
bool prime(int num, int x) {
// Base case: x > sqrt(num), so the number is prime
if (x > sqrt(num)) {
return true;
}
if (num % x == 0) {
// Found a divisor, so the number is not prime
return false;
}
// Recursive call with the next divisor
return prime(num, x + 1);
}
};
12345678910111213141516171819202122232425262728293031
class Solution {
// Main method for testing the checkPrime function
public static void main(String[] args) {
Solution solution = new Solution();
int num = 7;
boolean result = solution.checkPrime(num);
System.out.println(result);
}
public boolean checkPrime(int num) {
// 0 and 1 are not prime numbers
if (num <= 1) {
return false;
}
// Call the helper function to check for primality
return prime(num, 2);
}
private boolean prime(int num, int x) {
if (x > Math.sqrt(num)) {
return true;
}
// Found a divisor, so the number is not prime
if (num % x == 0) {
return false;
}
// Recursive call with the next divisor
return prime(num, x + 1);
}
}
1234567891011121314151617181920212223
class Solution:
def checkPrime(self, num):
if num <= 1:
return False # 0 and 1 are not prime numbers
return self.prime(num, 2) # Call the helper function to check for primality
def prime(self, num, x):
# Base case: x > sqrt(num), so the number is prime
if x > num ** 0.5:
return True
if num % x == 0:
# Found a divisor, so the number is not prime
return False
# Recursive call with the next divisor
return self.prime(num, x + 1)
# Main method for testing the checkPrime function
if __name__ == "__main__":
solution = Solution()
num = 7
result = solution.checkPrime(num)
print(result)
12345678910111213141516171819202122232425262728293031
class Solution {
// Method to check if a number is prime
checkPrime(num) {
if (num <= 1) {
return false;
}
// Call the helper function to check for primality
return this.prime(num, 2);
}
// Helper method to check for primality using recursion
prime(num, x) {
// Base case: x > sqrt(num), so the number is prime
if (x > Math.sqrt(num)) {
return true;
}
// Found a divisor, so the number is not prime
if (num % x === 0) {
return false;
}
// Recursive call with the next divisor
return this.prime(num, x + 1);
}
}
// Main method for testing the checkPrime function
const solution = new Solution();
const num = 7;
const result = solution.checkPrime(num);
console.log(result);
