mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-18 09:23:55 +08:00
e112434dee
* Add prettier config * test: add test to check for absolute function * chore: es5 to es6 * test: add test to check mean function * test: add test for sum of digit * test: add test for factorial * test: add test for fibonnaci * test: add test for find HCF * test: add test for lcm * test: add gridget test * test: add test for mean square error * test: add test for modular binary exponentiation * test: add tests for palindrome * test: add test for pascals triangle * test: add tests for polynomial * test: add tests for prime check * test: add tests for reverse polish notation * test: add tests for sieve of eratosthenes * test: add tests for pi estimation monte carlo method * chore: move tests to test folder * chore: fix standardjs errors
31 lines
814 B
JavaScript
31 lines
814 B
JavaScript
import {
|
|
FibonacciDpWithoutRecursion,
|
|
FibonacciRecursiveDP,
|
|
FibonacciIterative,
|
|
FibonacciRecursive
|
|
} from '../Fibonacci'
|
|
|
|
describe('Fibonanci', () => {
|
|
it('should return an array of numbers for FibonnaciIterative', () => {
|
|
expect(FibonacciIterative(5)).toEqual(
|
|
expect.arrayContaining([1, 1, 2, 3, 5])
|
|
)
|
|
})
|
|
|
|
it('should return an array of numbers for FibonnaciRecursive', () => {
|
|
expect(FibonacciRecursive(5)).toEqual(
|
|
expect.arrayContaining([1, 1, 2, 3, 5])
|
|
)
|
|
})
|
|
|
|
it('should return number for FibonnaciRecursiveDP', () => {
|
|
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])
|
|
)
|
|
})
|
|
})
|