diff options
| author | Paul Jungeblut <s_jungeb@i08pc55.atis-stud.uni-karlsruhe.de> | 2014-11-24 15:32:56 +0100 |
|---|---|---|
| committer | Paul Jungeblut <s_jungeb@i08pc55.atis-stud.uni-karlsruhe.de> | 2014-11-24 15:32:56 +0100 |
| commit | 9132c2f869e166f871027a99d1746f712397ce08 (patch) | |
| tree | f51aaed4aab3d8cb2bbb1ac11cb7d474f7ac15ed /math/primeSieve.cpp | |
| parent | cb1ed059fe6d3518436d32160e51c84d4517ea26 (diff) | |
small fixes
Diffstat (limited to 'math/primeSieve.cpp')
| -rw-r--r-- | math/primeSieve.cpp | 15 |
1 files changed, 3 insertions, 12 deletions
diff --git a/math/primeSieve.cpp b/math/primeSieve.cpp index 4c82bbe..db96e5b 100644 --- a/math/primeSieve.cpp +++ b/math/primeSieve.cpp @@ -1,12 +1,5 @@ -#include <iostream> -#include <vector> - -using namespace std; - -typedef unsigned long long ll; - -vector<int> primeSieve(ll n) { - vector<int> primes; +vector<int> primes; +void primeSieve(ll n) { //berechnet die Primzahlen kleiner n vector<int> isPrime(n,true); for(ll i = 2; i < n; i+=2) { if(isPrime[i]) { @@ -15,8 +8,6 @@ vector<int> primeSieve(ll n) { for(ll j = i; i*j < n; j+=2) isPrime[i*j] = false; } } - if(i == 2) - i--; + if(i == 2) i--; } - return primes; } |