mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-05 08:16:50 +08:00
Project euler problem 10 solution and test script
This commit is contained in:
22
Project-Euler/Problem10.js
Normal file
22
Project-Euler/Problem10.js
Normal file
@ -0,0 +1,22 @@
|
||||
// https://projecteuler.net/problem=10
|
||||
|
||||
const isPrime = (number) => {
|
||||
let flag = true
|
||||
for (let j = number - 1; j >= 2; j--) {
|
||||
if (number % j === 0) {
|
||||
flag = false
|
||||
}
|
||||
}
|
||||
return flag
|
||||
}
|
||||
|
||||
const calculateSumOfPrimeNumbers = (maxNumber) => {
|
||||
let sum = 0
|
||||
for (let i = maxNumber - 1; i >= 2; i--) {
|
||||
if (isPrime(i) === true) {
|
||||
sum += i
|
||||
}
|
||||
}
|
||||
return sum
|
||||
}
|
||||
export { calculateSumOfPrimeNumbers }
|
16
Project-Euler/test/Problem10.test.js
Normal file
16
Project-Euler/test/Problem10.test.js
Normal file
@ -0,0 +1,16 @@
|
||||
import { calculateSumOfPrimeNumbers } from '../Problem10'
|
||||
|
||||
describe('checkAnagram', () => {
|
||||
it('Return the sum of prime numbers upto but less than 14', () => {
|
||||
const SUT = calculateSumOfPrimeNumbers(14)
|
||||
expect(SUT).toBe(41)
|
||||
})
|
||||
it('Return the sum of prime numbers upto but less than 10', () => {
|
||||
const SUT = calculateSumOfPrimeNumbers(10)
|
||||
expect(SUT).toBe(17)
|
||||
})
|
||||
it('Return the sum of prime numbers upto but less than 100', () => {
|
||||
const SUT = calculateSumOfPrimeNumbers(100)
|
||||
expect(SUT).toBe(1060)
|
||||
})
|
||||
})
|
Reference in New Issue
Block a user