/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 vote225 views1 answer
Program to check smallest num in three numbers in c++
C++
0 vote271 views1 answer
Lambda function qt connect
C++
-2 votes275 views1 answer
Sum array c++
C++
-1 vote287 views1 answer
Intersection between vector c++
C++
0 vote257 views1 answer
How to rotate canvas android
C++
4 votes244 views3 answers
Pi in c++
C++
4 votes244 views1 answer
C++ show time elapsed
C++
1 vote268 views1 answer
Cpp std list example
C++
12 votes247 views1 answer
How to sort in descending order c++
C++
0 vote266 views1 answer
Initialize string with length c++
C++