/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

1 vote194 views1 answer
Qt qimage load from file
C++
0 vote179 views2 answers
Add variable to legend matlab
C++
1 vote192 views1 answer
If not defined c++
C++
6 votes178 views3 answers
Sstream c++
C++
2 votes181 views1 answer
How to create a structure c++
C++
0 vote214 views1 answer
BMI Calculator Program in C++
C++
1 vote173 views1 answer
Char type casting in c++
C++
0 vote194 views1 answer
What is blob in computer vision
C++
0 vote184 views1 answer
Cpp tutorial
C++
0 vote205 views1 answer
What is "\0" character in c++
C++