Computer Science, asked by fookme, 11 hours ago

find the sum of prime numbers in an array

Answers

Answered by aparuparava07

Answer:

Efficient Approach: Generate all primes up to the maximum element of the array using the sieve of Eratosthenes and store them in a hash. Now traverse the array and find the sum of those elements which are prime using the sieve. Below is the implementation of the efficient approach: C++

Explanation:

hiii

Previous Question

Next Question

Similar questions

Social Sciences, 6 hours ago

क सबधमक्या क्यासित पौधों में विभिन्न प्रकार के प्लास्टिडों की भूमिका का उल्लेख करें।...

Hindi, 6 hours ago

विषय- हिंदी स्वाध्याय --एक हिंदी पाठ्य पुस्तक में से पसंद आई किसी एक पाठ अथवा कविता का स्वमत लिखिए l class 9...

English, 6 hours ago

Write 2 things that are different about Xmas and eid ...

Hindi, 11 hours ago