/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

4 votes153 views1 answer
Get index of value c++
C++
1 vote356 views1 answer
BAPS
C++
0 vote176 views1 answer
Fisher–Yates shuffle Algorithm c++
C++
1 vote150 views1 answer
Building native binary with il2cpp unity
C++
0 vote145 views1 answer
Constructor syntax in c++
C++
1 vote154 views1 answer
Can you chnage the address of a pointer
C++
0 vote159 views1 answer
Free pair c++
C++
0 vote112 views2 answers
Shell sort descending order c++
C++
0 vote158 views1 answer
C++ std::find with lambda
C++
10 votes165 views2 answers
Difference between programming and coding
C++