Algorithm

Prime numbers between a and b can be found out by iterating through every number from a and b and checking for the number whether it is a prime number or not. For every number, we can check from 2 to square root of that number for finding tota number of divisors.

Code

#include <bits/stdc++.h>
using namespace std;

// Solution class to find prime numbers
class Solution {
public:
    // Function to check if a number is prime
    bool isPrime(int num) {
        // Handle edge cases
        if (num <= 1) return false;
        // Check for factors up to square root of num
        for (int i = 2; i * i <= num; i++) {
            if (num % i == 0)
                return false;
        }
        return true;
    }

    // Function to get all primes in range [a, b]
    vector<int> getPrimes(int a, int b) {
        vector<int> primes;
        // Loop through the range from a to b
        for (int i = a; i <= b; i++) {
            // If i is prime, add to result
            if (isPrime(i))
                primes.push_back(i);
        }
        return primes;
    }
};

// Main function
int main() {
    int a = 10, b = 30;

    // Create Solution object
    Solution sol;
    // Get prime numbers in range [a, b]
    vector<int> primes = sol.getPrimes(a, b);

    // Print the result
    cout << "Prim