recursive method

C++ snippet

void GetPrimeFactors(uint64_t number)
{
    if (number == 2)
    {
        primeFactors.push_back(number);
        return;
    }

    int max = floor(sqrt(number));
    uint64_t factor;
    for (uint64_t n = max; n > 1; n--)
    {
        if (IsPrime(n))
        {
            int remainder = number % n;
            GetPrimeFactors(remainder);
            primeFactors.push_back(n);
        }
    }
    return;
}