Feat: Created matrix search function with test cases

Maths/AutomorphicNumber.js

@@ -35,6 +35,6 @@ export const isAutomorphic = (n) => {
  n = Math.floor(n / 10)
  n_sq = Math.floor(n_sq / 10)
  }
- 
+
  return true
 }

Maths/test/AutomorphicNumber.test.js

@@ -9,19 +9,19 @@ describe('AutomorphicNumber', () => {
  })
 
  test.each([
- { n: -3 , expected: false },
- { n: -25 , expected: false },
+ { n: -3, expected: false },
+ { n: -25, expected: false }
  ])('should return false when n is negetive', ({ n, expected }) => {
  expect(isAutomorphic(n)).toBe(false)
  })
 
  test.each([
- { n: 7 , expected: false },
- { n: 83 , expected: false },
- { n: 0 , expected: true },
- { n: 1 , expected: true },
- { n: 376 , expected: true },
- { n: 90625 , expected: true },
+ { n: 7, expected: false },
+ { n: 83, expected: false },
+ { n: 0, expected: true },
+ { n: 1, expected: true },
+ { n: 376, expected: true },
+ { n: 90625, expected: true }
  ])('should return $expected when n is $n', ({ n, expected }) => {
  expect(isAutomorphic(n)).toBe(expected)
  })

Project-Euler/Problem006.js

@@ -1,8 +1,8 @@
 // https://projecteuler.net/problem=6
 
 export const squareDifference = (num = 100) => {
- let sumOfSquares = (num)*(num+1)*(2*num+1)/6
- let sums = (num*(num+1))/2
- 
+ let sumOfSquares = (num * (num + 1) * (2 * num + 1)) / 6
+ let sums = (num * (num + 1)) / 2
+
  return sums ** 2 - sumOfSquares // difference of square of the total sum and sum of squares
 }

Search/InterpolationSearch.js

@@ -36,4 +36,4 @@ export function interpolationSearch(arr, key) {
  }
 
  return -1
-}
+}

Search/MatrixSearch.js

@@ -0,0 +1,15 @@
+/**
+ * @param {T} key - The element to be found.
+ * @param {T[][]} matrix - The matrix in which the element should be found.
+ * @template T
+ * @returns {number[]} - An array containing the first found coordinates of the element.
+ */
+const MatrixSearch = (key, matrix) => {
+ for (let i = 0; i < matrix.length; i++) {
+ for (let j = 0; j < matrix[i].length; j++) {
+ if (matrix[i][j] === key) return [i, j] // Found the element, return its coordinates
+ }
+ }
+ return [-1, -1] // Element not found in the matrix
+}
+export { MatrixSearch }

Search/test/MatrixSearch.test.js

@@ -0,0 +1,51 @@
+import { MatrixSearch } from '../MatrixSearch' // Import the matrix search function
+
+describe('MatrixSearchAlgorithm', () => {
+ const searchParam = [
+ [
+ 5,
+ [
+ [1, 2, 3],
+ [4, 5, 6],
+ [7, 8, 9]
+ ],
+ [1, 1]
+ ],
+ [
+ 5,
+ [
+ [1, 2, 3],
+ [4, 6, 7],
+ [8, 9, 10]
+ ],
+ [-1, -1]
+ ],
+ [42, [[42]], [0, 0]],
+ [
+ 3,
+ [
+ [3, 5, 7],
+ [2, 4, 6],
+ [1, 8, 9]
+ ],
+ [0, 0]
+ ],
+ [
+ 1,
+ [
+ [3, 5, 7],
+ [2, 4, 6],
+ [1, 8, 9]
+ ],
+ [2, 0]
+ ],
+ [5, [], [-1, -1]]
+ ]
+
+ test.each(searchParam)(
+ 'should find the element in the matrix',
+ (key, matrix, expected) => {
+ expect(MatrixSearch(key, matrix)).toEqual(expected)
+ }
+ )
+})