Update Binary Exponentiation algorithm file to comply with Javascript standard rules

rahul1995 · rahul1995 · commit 5e6d813b6f1e · 2020-10-29T21:54:07.000+05:30
diff --git a/Maths/BinaryExponentiationIterative.js b/Maths/BinaryExponentiationIterative.js
@@ -12,13 +12,13 @@
 //          = exponent(x*x, floor(n/2))   ; if n is odd
 //          = x*exponent(x*x, floor(n/2)) ; if n is even
 const exponent = (x, n) => {
-    let ans = 1
-    while(n > 0) {
-        if(n%2 != 0) ans *= x
-        n = Math.floor(n/2)
-        if(n > 0) x *= x
-    }
-    return ans
+  let ans = 1
+  while (n > 0) {
+    if (n % 2 !== 0) ans *= x
+    n = Math.floor(n / 2)
+    if (n > 0) x *= x
+  }
+  return ans
 }
 
-export { exponent }
+export { exponent }
diff --git a/Maths/test/BinaryExponentiationIterative.test.js b/Maths/test/BinaryExponentiationIterative.test.js
@@ -1,15 +1,15 @@
 import { exponent } from '../BinaryExponentiationIterative'
 
 describe('exponent', () => {
-    it('should return 1 when power is 0', () => {
-        expect(exponent(5, 0)).toBe(1)
-    })
+  it('should return 1 when power is 0', () => {
+    expect(exponent(5, 0)).toBe(1)
+  })
 
-    it('should return 0 when base is 0', () => {
-        expect(exponent(0, 7)).toBe(0)
-    })
+  it('should return 0 when base is 0', () => {
+    expect(exponent(0, 7)).toBe(0)
+  })
 
-    it('should return the value of a base raised to a power', () => {
-        expect(exponent(3, 5)).toBe(243)
-    })
-})
+  it('should return the value of a base raised to a power', () => {
+    expect(exponent(3, 5)).toBe(243)
+  })
+})
