/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 votes100 views1 answer
Allocation an array with new cpp
C++
10 votes110 views2 answers
C++ function inside main
C++
0 vote104 views1 answer
Call to constructor of 'extClockType' is ambiguous extClockType time2;
C++
1 vote99 views1 answer
Concurrency in c++
C++
0 vote144 views1 answer
C++ get maximum value unsigned int
C++
1 vote107 views1 answer
Linked list with classes c++
C++
8 votes134 views10 answers
Javascript loop array
C++
0 vote104 views2 answers
The code execution cannot proceed because glew32.dll was not found
C++
0 vote94 views1 answer
Get type of variable in c++
C++
1 vote100 views1 answer
What is difference between single inverted and double inverted in programming languages
C++