Search results
61 packages found
A logic game
games-for-hexlet-project-one
Queue-based execution and eventing for tasks (ala GCD)
Brain Games Hexlet project №1
Get the greatest common devisor of two numbers
A wrapper around gcloud dataset for storing, retrieving and querying entities
This package contain os different cli games. Check if number is even. Provide a calculation result. Find GCD of 2 numbers. Find missed number in progression. Check if number is prime
This package contain os different cli games. Check if number is even. Provide a calculation result. Find GCD of 2 numbers. Find missed number in progression. Check if number is prime
Pollard's rho algorithm implemented in Node.js with long arithmetics
Calculates the greatest common divisor of two integers.
Brain games
Brain Games
Get the greatest common devisor of two numbers
function that checks greatest common divisor between two numbers
compute Greatest Common Divisor (GCD)
Get **Greatest Common Divisor (GCD)** using Euclidean Algorithm.
the call will result the GCD fo two numbers which are passed as parameters in call var gcd=require("publish_test_sakshi_kottawar/gcd"); var ans=gcd.GCD(5,6);
Euclid's greatest common divisor algorithm as a JavaScript component
A function that takes two integers and returns their greatest common divisor