Last active
April 5, 2017 18:29
Revisions
-
onilton revised this gist
Apr 5, 2017 . 1 changed file with 1 addition and 1 deletion.There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode charactersOriginal file line number Diff line number Diff line change @@ -3,5 +3,5 @@ def sieve(maxNumber: Int) = { if (p >= a.size) a else if (!a(p) || n >= a.size) innerSieve(p+1, 2*(p+1), a) else { a(n) = false ; innerSieve(p, p + n, a) } innerSieve(2, 2, Array.fill(maxNumber+1)(true)).zipWithIndex.filter(_._1).map(_._2) } -
onilton revised this gist
Apr 4, 2017 . 1 changed file with 1 addition and 2 deletions.There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode charactersOriginal file line number Diff line number Diff line change @@ -1,8 +1,7 @@ def sieve(maxNumber: Int) = { def innerSieve(p: Int, n: Int, a: Array[Boolean]): Array[Boolean] = if (p >= a.size) a else if (!a(p) || n >= a.size) innerSieve(p+1, 2*(p+1), a) else { a(n) = false ; innerSieve(p, p + n, a) } innerSieve(2, 2, Array.fill(maxNumber+1)(true)).zipWithIndex.filter(_._1).map(_._2) } -
onilton created this gist
Apr 3, 2017 .There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters. Learn more about bidirectional Unicode charactersOriginal file line number Diff line number Diff line change @@ -0,0 +1,8 @@ def sieve(maxNumber: Int) = { def innerSieve(p: Int, n: Int, a: Array[Boolean]): Array[Boolean] = if (p >= a.size) a else if (!a(p)) innerSieve(p+1, 2*(p+1), a) else if (n >= a.size) innerSieve(p+1, 2*(p + 1), a) else { a(n) = false ; innerSieve(p, p + n, a) } innerSieve(2, 2, Array.fill(maxNumber+1)(true)).zipWithIndex.filter(_._1).map(_._2) }