glsl implementation of the Euclid's algorithm for the calculation of the greatest common divisor.
npm install glsl-gcdGlsl implementation of the Euclid's algorithm for the calculation of the greatest common divisor.
``sh`
npm install glsl-gcd
`glsl
#pragma glslify: gcd = require(glsl-gcd)
float d = gcd(9., 6.); // return 3.
``