Computes the greatest common divisor (gcd). 

kgryte

planeshifter

compute-gcd

var isArray = require( 'validate.io-array' ),

	isIntegerArray = require( 'validate.io-integer-array' ),

	isFunction = require( 'validate.io-function' );

*	Computes the greatest common divisor of two integers `a` and `b`, using the binary GCD algorithm.

* @returns {Number} greatest common divisor

	// Reduce `a` and/or `b` to odd numbers and keep track of the greatest power of 2 dividing both `a` and `b`...

		// Remove all factors of 2 in `b`, as they are not common...

		// `a` and `b` are both odd. Swap values such that `b` is the larger of the two values, and then set `b` to the difference (which is even)...

*	Computes the greatest common divisor of two integers `a` and `b`, using the binary GCD algorithm and bitwise operations.

	while ( (a & 1) === 0 && (b & 1) === 0 ) {

  "description": "Computes the greatest common divisor (gcd).",

    "test-cov": "./node_modules/.bin/istanbul cover ./node_modules/.bin/_mocha --dir ./reports/coverage -- -R spec",

    "coveralls": "./node_modules/.bin/istanbul cover ./node_modules/.bin/_mocha --dir ./reports/coveralls/coverage --report lcovonly -- -R spec && cat ./reports/coveralls/coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js && rm -rf ./reports/coveralls"

    "url": "git://github.com/compute-io/gcd.git"

    "url": "https://github.com/compute-io/gcd/issues"

    "validate.io-integer-array": "^1.0.0"

      "url": "http://www.opensource.org/licenses/MIT"

		@@ -12,3 +12,3 @@ 'use strict';

		var MAXINT = Math.pow( 2, 53 ) - 1;
		var MAXINT = Math.pow( 2, 31 ) - 1;

		@@ -15,0 +15,0 @@

		{
		"name": "compute-gcd",
		"version": "1.2.0",
		"version": "1.2.1",
		"description": "Computes the greatest common divisor (gcd).",
		@@ -5,0 +5,0 @@ "author": {

New alerts

Worsened metrics