/C++/Prime numbers less than a given number c++

Prime numbers less than a given number c++

// This Function returns a vector containing all primes less than n using seive of eratosthenes
vector<long long> primes_less_than(long long n)
{
    vector<long long> ans(0);
    if (n <= 2)
        return ans;
    map<long long, bool> is_prime;
    for(long long i=0; i < n; i++) 
      	is_prime[i] = true;
    is_prime[0] = false;
    is_prime[1] = false;

    for (long long i = 2; i < sqrt(n); i++)
        if (is_prime[i])
            for (long long j = i * i; j < n; j += i)
                is_prime[j] = false;

    for(long long i=0; i < n; i++)
      	if (is_prime[i] == true) 
          	ans.push_back(i);
    return ans;
}

Similar codes

0 vote125 views1 answer
How to use qdebug c++
C++
0 vote152 views1 answer
Pop back innstring
C++
17 votes114 views2 answers
Initialize an array in c++
C++
0 vote135 views1 answer
Pca compact trick
C++
1 vote105 views1 answer
Locate specific string letters c++
C++
25 votes121 views5 answers
Text-decoration
C++
0 vote145 views1 answer
Curl upload folder and subfolders
C++
16 votes133 views3 answers
Console clear c+
C++
0 vote114 views1 answer
Cuda lock
C++
1 vote112 views1 answer
Vector library c++
C++