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

Fibonacci.js overhaul (#1049)

Browse Source
This commit is contained in:
Ricardo Fernández Serrata
2022-06-27 00:39:54 -04:00
committed by GitHub
parent 95a8ec08ed
commit 1b64ba68fa
2 changed files with 148 additions and 51 deletions
Download Patch File Download Diff File Expand all files Collapse all files

72
Maths/test/Fibonacci.test.js
View File

@ -2,30 +2,61 @@ import {
FibonacciDpWithoutRecursion,
FibonacciRecursiveDP,
FibonacciIterative,
FibonacciGenerator,
FibonacciRecursive,
FibonacciMatrixExpo
} from '../Fibonacci'
describe('Fibonacci', () => {
it('should return an array of numbers for FibonacciIterative', () => {
expect(FibonacciIterative(5)).toEqual(
expect.arrayContaining([1, 1, 2, 3, 5])
expect(FibonacciIterative(6)).toEqual(
expect.arrayContaining([0, 1, 1, 2, 3, 5, 8])
)
expect(FibonacciIterative(-6)).toEqual(
expect.arrayContaining([0, 1, -1, 2, -3, 5, -8])
)
})
it('should return number for FibonacciGenerator', () => {
const positive = FibonacciGenerator()
expect(positive.next().value).toBe(0)
expect(positive.next().value).toBe(1)
expect(positive.next().value).toBe(1)
expect(positive.next().value).toBe(2)
expect(positive.next().value).toBe(3)
expect(positive.next().value).toBe(5)
expect(positive.next().value).toBe(8)
const negative = FibonacciGenerator(true)
expect(negative.next().value).toBe(0)
expect(negative.next().value).toBe(1)
expect(negative.next().value).toBe(-1)
expect(negative.next().value).toBe(2)
expect(negative.next().value).toBe(-3)
expect(negative.next().value).toBe(5)
expect(negative.next().value).toBe(-8)
})
it('should return an array of numbers for FibonacciRecursive', () => {
expect(FibonacciRecursive(5)).toEqual(
expect.arrayContaining([1, 1, 2, 3, 5])
expect(FibonacciRecursive(6)).toEqual(
expect.arrayContaining([0, 1, 1, 2, 3, 5, 8])
)
expect(FibonacciRecursive(-6)).toEqual(
expect.arrayContaining([-0, 1, -1, 2, -3, 5, -8])
)
})
it('should return number for FibonacciRecursiveDP', () => {
expect(FibonacciRecursiveDP(5)).toBe(5)
expect(FibonacciRecursiveDP(6)).toBe(8)
expect(FibonacciRecursiveDP(-6)).toBe(-8)
})
it('should return an array of numbers for FibonacciDpWithoutRecursion', () => {
expect(FibonacciDpWithoutRecursion(5)).toEqual(
expect.arrayContaining([1, 1, 2, 3, 5])
expect(FibonacciDpWithoutRecursion(6)).toEqual(
expect.arrayContaining([0, 1, 1, 2, 3, 5, 8])
)
expect(FibonacciDpWithoutRecursion(-6)).toEqual(
expect.arrayContaining([0, 1, -1, 2, -3, 5, -8])
)
})
@ -36,5 +67,32 @@ describe('Fibonacci', () => {
expect(FibonacciMatrixExpo(3)).toBe(2)
expect(FibonacciMatrixExpo(4)).toBe(3)
expect(FibonacciMatrixExpo(5)).toBe(5)
expect(FibonacciMatrixExpo(6)).toBe(8)
expect(FibonacciMatrixExpo(-0)).toBe(-0)
expect(FibonacciMatrixExpo(-1)).toBe(1)
expect(FibonacciMatrixExpo(-2)).toBe(-1)
expect(FibonacciMatrixExpo(-3)).toBe(2)
expect(FibonacciMatrixExpo(-4)).toBe(-3)
expect(FibonacciMatrixExpo(-5)).toBe(5)
expect(FibonacciMatrixExpo(-6)).toBe(-8)
})
it('should return bigint for FibonacciMatrixExpo', () => {
expect(FibonacciMatrixExpo(0n)).toBe(0n)
expect(FibonacciMatrixExpo(1n)).toBe(1n)
expect(FibonacciMatrixExpo(2n)).toBe(1n)
expect(FibonacciMatrixExpo(3n)).toBe(2n)
expect(FibonacciMatrixExpo(4n)).toBe(3n)
expect(FibonacciMatrixExpo(5n)).toBe(5n)
expect(FibonacciMatrixExpo(6n)).toBe(8n)
expect(FibonacciMatrixExpo(-0n)).toBe(0n)
expect(FibonacciMatrixExpo(-1n)).toBe(1n)
expect(FibonacciMatrixExpo(-2n)).toBe(-1n)
expect(FibonacciMatrixExpo(-3n)).toBe(2n)
expect(FibonacciMatrixExpo(-4n)).toBe(-3n)
expect(FibonacciMatrixExpo(-5n)).toBe(5n)
expect(FibonacciMatrixExpo(-6n)).toBe(-8n)
})
})