/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

2 votes187 views2 answers
How to make a c++ program run in the background
C++
0 vote222 views1 answer
1162261467
C++
0 vote203 views1 answer
Alias namespaces c++
C++
0 vote230 views1 answer
Find first of a grammar
C++
0 vote215 views1 answer
Primtiive calculator in c++
C++
26 votes220 views2 answers
Remove element from vector on condition c++
C++
2 votes204 views3 answers
How to find length of character array in c++
C++
0 vote223 views1 answer
10011101
C++
0 vote237 views1 answer
Simple C++ game code
C++
1 vote265 views1 answer
Multithreading
C++