Near Matches
Ignore Exact
Everything
2
Euclid's algorithm (idea)
See all of Euclid's algorithm
, there are 5 more in this node.
(
idea
)
by
Sahr
Thu Oct 17 2002 at 22:41:57
Euclid's Algorithm has a very
elegant
recursive
definition:
Base Case: GCD(A, 0) = A
Recusive Case: GCD(A, B) = GCD(B, A%B)
This of course leads to a one-line
algorithm
in most any
high level programming language
. The function is
tail recursive
, so if you have a good
compiler
no
call stack
is built up.
Euclid's Limerick
Binary GCD algorithm
Chinese remainder theorem
Knowing how to sleep with someone
modulo
greatest common divisor
What the Tortoise Said to Achilles
Euclid
C++: Checking units at compile time
Binomial Theorem
Ring
tail recursion
Exact values of sine, cosine and tan
gay rainbow
number theory
algorithm
factorizing algorithm
S.P.O.C.K.
public key cryptography
mathematics
absolute value
GrÃ¶bner basis
How I almost broke RSA encryption
Sign in
Login
Password
remember me
Lost password
Sign up
Need help?
accounthelp@everything2.com
Recommended Reading
About Everything2
User Picks
September 29, 2023
Debtors' prison
unseen
Libera te Tutemet ex Inferis: The 2023 Halloween Horrorquest
Life in a Glass House
Debtors' prison
Editor Picks
The Waste Land
Merry Christmas vs. Happy Holidays
Atrocities in the Bible
Everything2 Decaversary Interviews: dann
Contemporary Christian music
Multiplier effect