salma-rodriguez

# Sieve of Eratosthenes, docstrings coming in Julia 0.4
function es(n::Int64) # accepts one 64 bit integer argument
       isprime = ones(Bool, n) # n-element vector of true-s
       isprime[1] = false # 1 is not a prime
       for i in 2:Int64(round(sqrt(n))) # loop integers from 2 to sqrt(n), explicit conversion to integer
           if isprime[i] # conditional evaluation
              for j in (i*i):i:n # sequence from i^2 to n with step i
                isprime[j] = false # j is divisible by i 
              end
           end 

seankross

# The Sieve of Eratosthenes

# Given a number greater than zero this function will return a list of primes between 2 and the number given as argument.
sieveOfEratosthenes <- function(num){
  values <- rep(TRUE, num)
	values[1] <- FALSE
	prev.prime <- 2
	for(i in prev.prime:sqrt(num)){
		values[seq.int(2 * prev.prime, num, prev.prime)] <- FALSE
		prev.prime <- prev.prime + min(which(values[(prev.prime + 1) : num]))