algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-04 07:29:47 +08:00
Code Issues Packages Projects Releases Wiki Activity

chore: Merge pull request #764 from lvlte/fixes

Browse Source 
PR#759 - Fix test/build script and comply with JS standard styles.
This commit is contained in:
Rak Laptudirm
2021-10-09 16:34:11 +05:30
committed by GitHub
parent 5a290c3ae5 8812f63ba2
commit 5f601fac8d
2 changed files with 7 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
Bit-Manipulation/IsPowerOfTwo.js
View File

@ -14,7 +14,7 @@
And we know that 1's complement is just opp. of that number.
So, (n & (n-1)) will be 0.
For eg: (1000 & (1000-1))
For eg: (1000 & (1000-1))
1 0 0 0 // Original Number (8)
0 1 1 1 // After Subtracting 1 (8-1 = 7)
_______
@ -23,6 +23,8 @@
*/
export const IsPowerOfTwo = (n) => {
if (n != 0 && (n & (n - 1)) == 0) return true
else return false
if (n > 0 && (n & (n - 1)) === 0) {
return true
}
return false
}

4
Bit-Manipulation/test/IsPowerOfTwo.test.js
View File

@ -5,9 +5,9 @@ test('Check if 0 is a power of 2 or not:', () => {
expect(res).toBe(false)
})
test('Check if 0 is a power of 2 or not:', () => {
test('Check if 1 is a power of 2 or not:', () => {
const res = IsPowerOfTwo(1)
expect(res).toBe(false)
expect(res).toBe(true)
})
test('Check if 4 is a power of 2 or not:', () => {