1
0
mirror of https://github.com/janet-lang/janet synced 2024-12-11 01:10:25 +00:00
janet/examples/primes.dst

15 lines
361 B
Plaintext
Raw Normal View History

# Return an array of primes. This is a trivial and extremely naive algorithm.
(defn primes
"Returns a list of prime numbers less than n."
[n]
(def list @[])
(for [i 2 n]
(var isprime? true)
(def len (length list))
(for [j 0 len]
(def trial (get list j))
(if (zero? (% i trial)) (:= isprime? false)))
(if isprime? (array.push list i)))
list)