Euclidean algorithm noun2 •Specifically, a method, based on a division algorithm, for finding the greatest common divisor (gcd) of two given integers; any of certain variations or generalisations of said method. •Any of certain algorithms first described in Euclid's Elements. formsEuclidean algorithms