/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

7 votes159 views2 answers
Cpp stl
C++
0 vote182 views1 answer
C++ unordered_map check if key exists
C++
0 vote201 views1 answer
How to use getline function inc
C++
1 vote166 views1 answer
Merge images opencv c++
C++
1 vote193 views6 answers
Insertion sort
C++
0 vote191 views1 answer
C++ compare time
C++
1 vote196 views3 answers
C++ concatenate strings
C++
1 vote230 views1 answer
Multiply two numbers <=10^18 %m in cpp
C++
0 vote198 views1 answer
Shell-Sort C++
C++
9 votes180 views2 answers
Vector fin element c++
C++