/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

0 vote162 views1 answer
Upcasting in c++
C++
2 votes195 views2 answers
Qt disable resizing window
C++
0 vote192 views1 answer
Youtube backlink generator tool
C++
5 votes179 views2 answers
Delete specific row from dynamic 2d array c++
C++
-1 vote176 views1 answer
String array 2d c++
C++
0 vote166 views1 answer
C++ write to csv file append
C++
0 vote181 views1 answer
C++ write number to registry
C++
1 vote163 views1 answer
System cpp
C++
25 votes156 views5 answers
Text-decoration
C++
4 votes158 views1 answer
Arduino uno hello world
C++