forked from TheAlgorithms/Go
-
Notifications
You must be signed in to change notification settings - Fork 0
/
sieve.go
40 lines (33 loc) · 875 Bytes
/
sieve.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
// sieve.go
// description: Algorithms for generating prime numbers efficiently
// author(s) [Taj](https://github.com/tjgurwara99)
// see sieve_test.go
package prime
// Generate generates the sequence of integers starting at 2 and sends it to the channel `ch`
func GenerateChannel(ch chan<- int) {
for i := 2; ; i++ {
ch <- i
}
}
// Sieve Sieving the numbers that are not prime from the channel - basically removing them from the channels
func Sieve(in <-chan int, out chan<- int, prime int) {
for {
i := <-in
if i%prime != 0 {
out <- i
}
}
}
// Generate returns a int slice of prime numbers up to the limit
func Generate(limit int) []int {
var primes []int
ch := make(chan int)
go GenerateChannel(ch)
for i := 0; i < limit; i++ {
primes = append(primes, <-ch)
ch1 := make(chan int)
go Sieve(ch, ch1, primes[i])
ch = ch1
}
return primes
}