Sieve of Eratosthenes with Accelerate

Sieve.swift

// Calculate prime numbers in a given range
// using Sieve of Eratosthenes

import Accelerate

var primes: [Int] = []

let range = 0...999
var numbers = range.map(Float.init)

for n in range.dropLast() {
    guard numbers[n] > 1 else { continue }
    defer { primes.append(n) }
  
    // Clear vector elements with given stride
    // (i.e. set value to 0)
    vDSP_vclr(&numbers, 
              numericCast(n), 
              numericCast(numbers.count / n))
}

print(primes)

Try this: https://gist.github.com/willie/c589832bc009350578acdbfda4dbcd2c