//main logic
bool isPrimeRec(unsigned int number, unsigned int stop, unsigned int i)
{
    if (number == 1 || number == 2)
        return true;
    if (number % i == 0)
        return false;
    if (i == stop)
        return true;
    return isPrimeRec(number, stop, i + 1);
}

// "wrapper function" is a function which wraps another function (in our example the recursive one).
// It's essentially another function which calls the actual function.
bool isPrime(unsigned int number)
{
    return isPrimeRec(number, sqrt(number), 2);
}