/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 vote156 views1 answer
Remove item from layout
C++
0 vote134 views1 answer
Get future from promise c++
C++
1 vote167 views1 answer
Stack implementation using linked list in cpp
C++
0 vote138 views1 answer
I++ and++i
C++
3 votes140 views1 answer
Initializing 2d vector
C++
0 vote137 views1 answer
C++ thread wait fro 1 sec
C++
0 vote152 views5 answers
Asd
C++
-1 vote139 views1 answer
How to empty an array c++
C++
1 vote158 views1 answer
Separation between paragraphs latex
C++
1 vote137 views1 answer
String c++ if letter or number
C++