Search results
65 packages found
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);
published 1.0.1 5 years ago
M
Q
P
Euclid's greatest common divisor algorithm as a JavaScript component
published 0.0.0 7 years ago
M
Q
P
A function that takes two integers and returns their greatest common divisor
published 1.0.0 4 years ago
M
Q
P
M
Q
P
Queue-based execution and eventing for tasks (ala GCD)
published 0.0.3 10 years ago
M
Q
P