/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 vote124 views1 answer
C++ sum a vector of digits
C++
-1 vote135 views1 answer
#include
C++
0 vote88 views1 answer
SDL_BlitSurface
C++
0 vote136 views1 answer
Std::ofstream file1(FILE_NAME, std::ios::app);
C++
1 vote123 views1 answer
Enumerate with letters latex
C++
0 vote197 views1 answer
Vector c++ length integer
C++
1 vote160 views1 answer
Default access specifier in c++
C++
1 vote170 views2 answers
C++ inherit from class template
C++
-2 votes125 views6 answers
Array in c++
C++
-1 vote138 views2 answers
Function template c++
C++