algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-05 00:01:37 +08:00
Code Issues Packages Projects Releases Wiki Activity

tests: Project Euler Problem 2 (#1200)

Browse Source
This commit is contained in:
Omkarnath Parida
2022-10-17 01:52:29 +05:30
committed by GitHub
parent 4ce3dbe6b4
commit 2a62eabfd7
3 changed files with 19 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
Project-Euler/Problem002.js
View File

@ -5,8 +5,10 @@ const PHI = (1 + SQ5) / 2 // definition of PHI
// theoretically it should take O(1) constant amount of time as long
// arithmetic calculations are considered to be in constant amount of time
export const EvenFibonacci = (limit) => {
if (limit < 1) throw new Error('Fibonacci sequence limit can\'t be less than 1')
const highestIndex = Math.floor(Math.log(limit * SQ5) / Math.log(PHI))
const n = Math.floor(highestIndex / 3)
return ((PHI ** (3 * n + 3) - 1) / (PHI ** 3 - 1) -
((1 - PHI) ** (3 * n + 3) - 1) / ((1 - PHI) ** 3 - 1)) / SQ5
return Math.floor(((PHI ** (3 * n + 3) - 1) / (PHI ** 3 - 1) -
((1 - PHI) ** (3 * n + 3) - 1) / ((1 - PHI) ** 3 - 1)) / SQ5)
}

14
Project-Euler/test/Problem002.test.js Normal file
View File

@ -0,0 +1,14 @@
import { EvenFibonacci } from '../Problem002'
describe('Even Fibonacci numbers', () => {
it('should throw error when limit is less than 1', () => {
expect(() => EvenFibonacci(-1)).toThrowError('Fibonacci sequence limit can\'t be less than 1')
})
test('when limit is greater than 0', () => {
expect(EvenFibonacci(40)).toBe(44)
})
// Project Euler Condition Check
test('when limit is 4 million', () => {
expect(EvenFibonacci(4e6)).toBe(4613732)
})
})