Added all missing tests

Rudxain · web-flow · commit 2bcbc5889882 · 2022-06-21T14:25:45.000-04:00
diff --git a/Maths/test/Fibonacci.test.js b/Maths/test/Fibonacci.test.js
@@ -8,24 +8,34 @@ import {
 
 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 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)
   })
 
   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 +46,30 @@ describe('Fibonacci', () => {
     expect(FibonacciMatrixExpo(3)).toBe(2)
     expect(FibonacciMatrixExpo(4)).toBe(3)
     expect(FibonacciMatrixExpo(5)).toBe(5)
+    expect(FibonacciMatrixExpo(6)).toBe(8)
+    
+    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(-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)
+    
+    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)
   })
 })
