Skip to content

add Scala implementation for Euclidean #427

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 10 commits into from
Oct 5, 2018
Merged

add Scala implementation for Euclidean #427

Changes from 1 commit
Commits
Show all changes
10 commits
Select commit Hold shift + click to select a range
ca4a1f7
add Scala example for Euclidean
Oct 3, 2018
281537c
deal with negative args and zero
Oct 3, 2018
53763f1
deal with negative args and zero
Oct 3, 2018
84e1841
Merge branch 'euclidean_in_scala' of https://github.com/kenpower/algo…
Oct 3, 2018
5f761e5
rename function
Oct 4, 2018
3c6457b
Merge branch 'master' of https://github.com/algorithm-archivists/algo…
Oct 4, 2018
c6ffce1
change method name
Oct 4, 2018
f80bc47
Merge branch 'master' of https://github.com/algorithm-archivists/algo…
Oct 4, 2018
d39bfb2
fix typo
Oct 5, 2018
6f87fa6
Merge branch 'master' of https://github.com/algorithm-archivists/algo…
Oct 5, 2018
File filter

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
fix typo
  • Loading branch information
Ken Power committed Oct 5, 2018
commit d39bfb2f152d8fb9d0f7d937dbbac26f478d19b7
12 changes: 6 additions & 6 deletions contents/euclidean_algorithm/euclidean_algorithm.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -40,9 +40,9 @@ The algorithm is a simple way to find the *greatest common divisor* (GCD) of two
{% sample lang="nim" %}
[import:13-24, lang="nim"](code/nim/euclid_algorithm.nim)
{% sample lang="f90" %}
[import:1-19, lang="Fortran"](code/fortran/euclidean.f90)
[import:1-19, lang="fortran"](code/fortran/euclidean.f90)
{% sample lang="scala" %}
[import:3-8, lang="Scala"](code/scala/euclidean.scala)
[import:3-8, lang="scala"](code/scala/euclidean.scala)
{% sample lang="racket" %}
[import:3-14, lang="lisp"](code/racket/euclidean_algorithm.rkt)
{% endmethod %}
Expand Down Expand Up @@ -91,9 +91,9 @@ Modern implementations, though, often use the modulus operator (%) like so
{% sample lang="nim" %}
[import:1-11, lang="nim"](code/nim/euclid_algorithm.nim)
{% sample lang="f90" %}
[import:21-34, lang="Fortran"](code/fortran/euclidean.f90)
[import:21-34, lang="fortran"](code/fortran/euclidean.f90)
{% sample lang="scala" %}
[import:10-14, lang="Scala"](code/scala/euclidean.scala)
[import:10-14, lang="scala"](code/scala/euclidean.scala)
{% sample lang="racket" %}
[import:16-24, lang="lisp"](code/racket/euclidean_algorithm.rkt)
{% endmethod %}
Expand Down Expand Up @@ -147,9 +147,9 @@ The Euclidean Algorithm is truly fundamental to many other algorithms throughout
{% sample lang="nim" %}
[import, lang="nim" %](code/nim/euclid_algorithm.nim)
{% sample lang="f90" %}
[import, lang="Fortran"](code/fortran/euclidean.f90)
[import, lang="fortran"](code/fortran/euclidean.f90)
{% sample lang="scala" %}
[import, lang="Scala"](code/scala/euclidean.scala)
[import, lang="scala"](code/scala/euclidean.scala)
{% sample lang="racket" %}
[import, lang="lisp"](code/racket/euclidean_algorithm.rkt)
{% endmethod %}
Expand Down