2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/32469We present a new GCD algorithm of two integers or polynomials. The algorithm is iterative and its time complexity is still $O(n \\log^2 n ~ log \\log n)$ for $n$-bit inputs.Data Structures and Algorithmstext