GCD using Euclid's algorithm (mcd) in c++

euclidsAlgorithm.cpp

// https://www.youtube.com/watch?v=7HCd074v8g8&list=PL2_aWCzGMAwLL-mEB4ef20f3iqWMGWa25&index=8&t=0s

#include <iostream>
#include <list>
#include <cmath>

int brutDivision(int a, int b) {
    int gcd = 1;
    std::list<int> factors;
    for (int i = 2; i < sqrt(a); i++) {
        if (a % i == 0) {
            factors.push_back(i);
            factors.push_back(a / i);
        }
    };
    for (int factor: factors) {
        if (factor > gcd)
            gcd = factor;
    }
    return gcd;
}

int euclids(int a, int b) {
    int dividend = a > b ? a : b;
    int divisor  = a < b ? a : b;

    while (divisor != 0) {
        int remainder = dividend / divisor;
        dividend = divisor;
        divisor = remainder;
    }
    return dividend;
}

int main() {
    int a = 105;
    int b = 350;
    std::cout << brutDivision(a, b) << std::endl;
    std::cout << euclids(a, b) << std::endl;
    return 0;
}