We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent b8bd32a commit 674e54bCopy full SHA for 674e54b
src/lib/math/greatest-common-divisor/greatest-common-divisor.ts
@@ -1,8 +1,12 @@
1
/**
2
- * Returns greatest common divider from number using iterative Euclid's algorithm
+ * Returns greatest common divider of two numbers
3
+ * using iterative Euclid's algorithm
4
+ *
5
* @link https://en.wikipedia.org/wiki/Euclidean_algorithm
6
*
- * Iterative algorithm much faster (in average ~1.335) than recursive
7
+ * Iterative algorithm much faster
8
+ * in average ~1.335 (own benchmarks)
9
+ * than recursive
10
11
* @param {number} a
12
* @param {number} b
0 commit comments