chore: change == into ===

TheAlgorithms · Oct 2, 2024 · 71bd746 · 71bd746
1 parent 2070918
commit 71bd746
Show file tree

Hide file tree

Showing 3 changed files with 5 additions and 5 deletions.
diff --git a/maths/binary_exponentiation.ts b/maths/binary_exponentiation.ts
@@ -22,7 +22,7 @@ export const binaryExponent = (numbers: number[]): number => {
 
  // binary exponentiation algorithm
  // if B == 0
- if (numbers[1] == 0) {
+ if (numbers[1] === 0) {
  // A^0 = 1
  return 1;
  }

diff --git a/maths/co_prime.ts b/maths/co_prime.ts
@@ -19,20 +19,20 @@ export const coPrime = (numbers: number[]): boolean => {
  }
 
  // handle input being 1
- if (numbers[0] == 1 || numbers[1] == 1) return false
+ if (numbers[0] === 1 || numbers[1] === 1) return false
 
  let factors0 = []
  let factors1 = []
 
  // iterate from 2 to the square root of num to find a factor
  // add factors to arrays
  for (let i = 2; i <= Math.sqrt(numbers[0]); i++) {
- if (numbers[0] % i == 0) {
+ if (numbers[0] % i === 0) {
  factors0.push(i)
  }
  }
  for (let i = 2; i <= Math.sqrt(numbers[1]); i++) {
- if (numbers[1] % i == 0) {
+ if (numbers[1] % i === 0) {
  factors1.push(i)
  }
  }

diff --git a/maths/geometric_mean.ts b/maths/geometric_mean.ts
@@ -14,7 +14,7 @@ export const geometricMean = (numbers: number[]): number => {
  throw new TypeError('Invalid Input')
  }
  for(let i=0; i < numbers.length; i++){
- if (numbers[i] == 0) {
+ if (numbers[i] === 0) {
  return 0
  }
  }