Skip to content
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion ch04-logic-and-recursion.asciidoc
Original file line number Diff line number Diff line change
Expand Up @@ -30,7 +30,7 @@ To find the GCD of integers M and N:
* Otherwise M must be less than N, and the result is the GCD of M and N - M.

Write a function +gcd/2+ in a module named +dijkstra+ that implements
the algorithm. This program is a good place to practice Elixir's +cond+ construct.
the algorithm. This program is a good place to practice Erlang's +if+ construct.
Here is some sample output.

[source,erl]
Expand Down