Loïc TRUCHOT
d6b8dd394a
Chore(math-translation-FR-fr): a pack of translations for the math section ( #558 )
...
* chore(factorial): translation fr-FR
* feat(math-translation-fr-FR): fast powering
* feat(math-translation-fr-FR): fibonacci numbers
* chore(math-translation-fr-FR): bits
* chore(math-translation-fr-FR): complex number
* chore(math-translation-fr-FR): euclidean algorithm
* chore(math-translation-fr-FR): fibonacci number
* chore(math-translation-fr-FR): fourier transform
* chore(math-translation-fr-FR): fourier transform WIP
* chore(math-translation-fr-FR): fourier transform done
* chore(math-translation-fr-FR): fourier transform in menu
2020-10-05 22:13:47 +03:00
Oleksii Trekhleb
2451db975d
Add iterative version of Euclidean algorithm.
2018-09-18 08:17:47 +03:00
Vamshi Bachaneboina
c00c689255
Update euclideanAlgorithm.js ( #207 )
...
Method 2 is easy to evaluate or understand without using recursion stack!
2018-09-18 08:04:56 +03:00
Bruce-Feldman
e36c441fa9
Minor fixes. ( #91 )
...
* Get Bit: Make more terse
* Power of two: Allowed 1 as a valid power of 2.
Power of two: Removed unnecessary exception throwing.
* Fisher Yates: Made more terse
* Least Common Multiple: Fill undefined value
* Greatest Common Divisor: Fill undefined value.
Greatest Common Divisor: Make more terse.
2018-07-04 17:53:22 +03:00
Oleksii Trekhleb
91457191b1
Add lcm.
2018-04-17 09:28:15 +03:00
Oleksii Trekhleb
4fc5483892
Add primality tests.
2018-04-17 08:02:06 +03:00
