We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
2 parents 3463c4b + de32273 commit ee379e3Copy full SHA for ee379e3
nth-prime/nth_prime.exs
@@ -10,16 +10,23 @@ defmodule Prime do
10
def nth(n), do: calc_nth(n)
11
12
defp calc_nth(n, acc \\ 5, i \\ 11)
13
- defp calc_nth(n, n, i), do: i
+
14
+ defp calc_nth(n, n, i) do
15
+ i
16
+ end
17
18
defp calc_nth(n, acc, i) when acc < n do
19
cond do
- is_prime(i+1) -> calc_nth(n, acc+1, i+1)
- true -> calc_nth(n, acc, i+1)
20
+ prime?(i+1) ->
21
+ calc_nth(n, acc+1, i+1)
22
23
+ true ->
24
+ calc_nth(n, acc, i+1)
25
end
26
27
- defp is_prime(i, n \\ 2)
- defp is_prime(i, n) when n < i and rem(i, n) == 0, do: false
- defp is_prime(i, n) when n < i, do: is_prime(i, n+1)
- defp is_prime(i, i), do: true
28
+ defp prime?(i, n \\ 2)
29
+ defp prime?(i, n) when n < i and rem(i, n) == 0, do: false
30
+ defp prime?(i, n) when n < i, do: is_prime(i, n+1)
31
+ defp prime?(i, i), do: true
32
0 commit comments