mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-18 17:49:40 +08:00
41 lines
1.1 KiB
JavaScript
41 lines
1.1 KiB
JavaScript
import {
|
|
FibonacciDpWithoutRecursion,
|
|
FibonacciRecursiveDP,
|
|
FibonacciIterative,
|
|
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])
|
|
)
|
|
})
|
|
|
|
it('should return an array of numbers for FibonacciRecursive', () => {
|
|
expect(FibonacciRecursive(5)).toEqual(
|
|
expect.arrayContaining([1, 1, 2, 3, 5])
|
|
)
|
|
})
|
|
|
|
it('should return number for FibonacciRecursiveDP', () => {
|
|
expect(FibonacciRecursiveDP(5)).toBe(5)
|
|
})
|
|
|
|
it('should return an array of numbers for FibonacciDpWithoutRecursion', () => {
|
|
expect(FibonacciDpWithoutRecursion(5)).toEqual(
|
|
expect.arrayContaining([1, 1, 2, 3, 5])
|
|
)
|
|
})
|
|
|
|
it('should return number for FibonacciMatrixExpo', () => {
|
|
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)
|
|
})
|
|
})
|