/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 vote96 views1 answer
GetCurrentThreadId c
C++
0 vote107 views1 answer
C++ pointer to vector
C++
1 vote88 views1 answer
What are specialized classes c++
C++
0 vote102 views1 answer
Flowchart to display factors of a number
C++
2 votes98 views2 answers
Copy array c++
C++
3 votes97 views2 answers
Opencv(4.1.2) /io/opencv/modules/imgproc/src/resize.cpp:3720: error: (-215:assertion failed) !ssize.empty() in function 'resize'
C++
1 vote100 views2 answers
How to get size of char array in c++
C++
0 vote101 views1 answer
Inline in class in C++
C++
4 votes103 views1 answer
C++ measure time
C++
1 vote91 views1 answer
0009:err:mscoree:CLRRuntimeInfo_GetRuntimeHost Wine Mono is not installed
C++