一个经典的算法要求算出小于给定数n的所有素数。一般的串行算法如下:
未完待续......
- PRIME(n)
- vector<bool> A, and set all elements(except A[0]) in A to TRUE
- for i = 2 to sqrt(n)
- if A[i-1] == TRUE
- set A[(multiples of i to n)-1] to FALSE
- end if
- end loop
- for any i, if A[i-1] is TRUE , i is prime number
未完待续......