Log in
My Tools
Shell (Sow)
Shell (Guacamole)
Shell (Tabby)
Code Explorer
Matrix Chat
My Web Server
My Digital Portfolio
My IGIS
Proficiency Progress
Sash Awards
CEG-ID
Keys and Commands
Guacamole Keys
Emacs Keys
Magit Keys
Screen Keys
LLDB Commands
Overviews
Experiences Overview
Experiences Explorer
Topic Explorer
Curricula Assistant
Trailblazers
References
Swift Live Reference
Glossary
Common Errors
References
Code Snippets
Navigation
Experiences Overview
Google
Special Users
Authors
Guides
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
Browse properties
W1172 Greatest Common Divisor
From Coder Merlin
Revision as of 23:32, 20 January 2020 by
Chukwuemeka-tinashe
(
talk
|
contribs
)
(
→Background
)
(
diff
)
← Older revision
|
Latest revision
(
diff
) |
Newer revision →
(
diff
)
Jump to:
navigation
,
search
Within these castle walls be forged Mavens of Computer Science ...
— Merlin, The Coder
(image on right)
Contents
1
Prerequisites
2
Background
3
Introduction
4
Topic Headers
5
Key Concepts
6
Exercises
7
References
Prerequisites
[
edit
]
Background
[
edit
]
Euclidean Algorithm
(Wikipedia)
Introduction
[
edit
]
Topic Headers
[
edit
]
Key Concepts
[
edit
]
Exercises
[
edit
]
Template:W1172-Exercises
References
[
edit
]
https://www.facebook.com/Coder-Merlin-101592328319584/
https://teespring.com/stores/coder-merlin
https://twitter.com/codermerlin
https://discord.gg/Hj7mTVtMbH
https://discourse.codermerlin.com/
https://openbadges.org/
Designed with pride in Silicon Valley, CA, USA
