Answer to Question #157621 in C++ for zain ul abdeen

Question

Write a function which takes as argument two integers and prints all the prime numbers between those two numbers. If the first number is smaller than the second, the prime numbers would be displayed in an increasing order. If the first number is bigger than the second, the prime numbers would be displayed in an decreasing order.

Answer 1

#include <iostream>
#include <cmath>


using namespace std;


bool isPrime(int number)
{
    if(number == 1 || number == 2)
        return true;
    for(int i = 2; i <= pow(number,0.5); i++)
    {
        if(number%i == 0)
            return false;


    }
    return true;
}


void printPrimes(int firstNumber,int secondNumber)
{
    if(firstNumber>secondNumber)
    {
        for(int i = firstNumber; i >= secondNumber; i--)
        {
            if(isPrime(i))
                cout << i << " ";
        }
    }
    else
    {
        for(int i = firstNumber; i <= secondNumber; i++)
        {
            if(isPrime(i))
                cout << i << " ";
        }
    }
}


int main()
{
    int firstNumber, secondNumber;
    cout << "Enter first number:";
    cin >> firstNumber;
    cout << "Enter second number:";
    cin >> secondNumber;


    printPrimes(firstNumber,secondNumber);
    return 0;
}