diff --git a/Maths/SieveOfEratosthenesIntArray.js b/Maths/SieveOfEratosthenesIntArray.js
new file mode 100644
index 0000000000..7de49ffb73
--- /dev/null
+++ b/Maths/SieveOfEratosthenesIntArray.js
@@ -0,0 +1,22 @@
+/**
+ * Function to get all prime numbers below a given number
+ * This function returns an array of prime numbers
+ * @see {@link https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes}
+ */
+
+function sieveOfEratosthenes (max) {
+ const sieve = []
+ const primes = []
+
+ for (let i = 2; i <= max; ++i) {
+ if (!sieve[i]) { // If i has not been marked then it is prime
+ primes.push(i)
+ for (let j = i << 1; j <= max; j += i) { // Mark all multiples of i as non-prime
+ sieve[j] = true
+ }
+ }
+ }
+ return primes
+}
+
+export { sieveOfEratosthenes }
diff --git a/Maths/test/SieveOfEratosthenesIntArray.test.js b/Maths/test/SieveOfEratosthenesIntArray.test.js
new file mode 100644
index 0000000000..eeb6dd9d8b
--- /dev/null
+++ b/Maths/test/SieveOfEratosthenesIntArray.test.js
@@ -0,0 +1,12 @@
+import { sieveOfEratosthenes } from '../SieveOfEratosthenesIntArray'
+import { PrimeCheck } from '../PrimeCheck'
+
+describe('should return an array of prime numbers', () => {
+ it('should have each element in the array as a prime numbers', () => {
+ const n = 100
+ const primes = sieveOfEratosthenes(n)
+ primes.forEach(prime => {
+ expect(PrimeCheck(prime)).toBeTruthy()
+ })
+ })
+})
pFad - Phonifier reborn
Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.
Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.
Alternative Proxies:
Alternative Proxy
pFad Proxy
pFad v3 Proxy
pFad v4 Proxy