/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 vote144 views1 answer
How to declare a function in c++ header file
C++
0 vote186 views1 answer
Upcasting in c++
C++
31 votes88 views1 answer
When to use struct vs class c++
C++
1 vote134 views3 answers
Auto in cpp
C++
-1 vote126 views1 answer
Cod Cold War no recoil
C++
0 vote131 views2 answers
C++ function for checking if a sting is a number
C++
0 vote132 views1 answer
What is g++ and gcc
C++
0 vote136 views1 answer
Cin une énumération
C++
1 vote131 views1 answer
STD::ERASE FUNCTION IN C++
C++
0 vote136 views1 answer
Variabili in c++
C++