JS Basic
JS Interview Programs
- JS Interview Programs
- JS Abundant Number
- JS Amicable Number
- JS Armstrong Number
- JS Average of N Numbers
- JS Automorphic Number
- JS Biggest of three numbers
- JS Binary to Decimal
- JS Common Divisors
- JS Composite Number
- JS Condense a Number
- JS Cube Number
- JS Decimal to Binary
- JS Decimal to Octal
- JS Disarium Number
- JS Even Number
- JS Evil Number
- JS Factorial of a Number
- JS Fibonacci Series
- JS GCD
- JS Happy Number
- JS Harshad Number
- JS LCM
- JS Leap Year
- JS Magic Number
- JS Matrix Addition
- JS Matrix Division
- JS Matrix Multiplication
- JS Matrix Subtraction
- JS Matrix Transpose
- JS Maximum Value of an Array
- JS Minimum Value of an Array
- JS Multiplication Table
- JS Natural Number
- JS Number Combination
- JS Odd Number
- JS Palindrome Number
- JS Pascalβs Triangle
- JS Perfect Number
- JS Perfect Square
- JS Power of 2
- JS Power of 3
- JS Pronic Number
- JS Prime Factor
- JS Prime Number
- JS Smith Number
- JS Strong Number
- JS Sum of Array
- JS Sum of Digits
- JS Swap Two Numbers
- JS Triangular Number
JavaScript Program to Check Evil Number
Photo Credit to CodeToFun
π Introduction
In the realm of programming, understanding the properties of numbers is a fascinating journey. One interesting concept is that of Evil Numbers.
An Evil Number is a non-negative integer that has an even number of '1' bits in its binary representation.
In this tutorial, we will explore a JavaScript program designed to check whether a given number is an Evil Number.
The program involves converting the decimal number to its binary representation and counting the number of '1' bits.
π Example
Let's delve into the JavaScript code that accomplishes this task.
// Function to count the number of set bits (1s) in binary representation
function countSetBits(number) {
let count = 0;
while (number) {
count += number & 1;
number >>= 1;
}
return count;
}
// Function to check if a number is an Evil Number
function isEvilNumber(number) {
// Count the number of set bits in the binary representation
const setBitsCount = countSetBits(number);
// If the count of set bits is even, it is an Evil Number
return setBitsCount % 2 === 0;
}
// Driver program
// Replace this value with the number you want to check
const number = 15;
// Call the function to check if the number is an Evil Number
if (isEvilNumber(number))
console.log(`${number} is an Evil Number.`);
else
console.log(`${number} is not an Evil Number.`);
π» Testing the Program
To test the program with different numbers, modify the value of number in the code.
15 is an Evil Number.
Run the script to check if the specified number is an Evil Number.
π§ How the Program Works
- The program defines a function countSetBits that takes a number as input and returns the count of set bits (1s) in its binary representation.
- The function isEvilNumber checks if the count of set bits is even, indicating that the number is an Evil Number.
- Replace the value of number in the main program with the desired number you want to check.
- The program calls the isEvilNumber function and logs the result to the console.
π Between the Given Range
Let's explore the javascript code that checks for Evil Numbers in the specified range.
// Function to check if a number is Evil
function isEvilNumber(num) {
// Convert the number to binary
const binaryRepresentation = num.toString(2);
// Count the number of '1' bits
const countOnes = binaryRepresentation.split('1').length - 1;
// Check if the count of '1' bits is even (Evil Number)
return countOnes % 2 === 0;
}
// Function to find Evil Numbers in a specified range
function findEvilNumbersInRange(start, end) {
const evilNumbers = [];
for (let i = start; i <= end; i++) {
if (isEvilNumber(i)) {
evilNumbers.push(i);
}
}
return evilNumbers;
}
// Driver program
// Define the range
const startRange = 1;
const endRange = 10;
// Call the function to find Evil Numbers in the range
const evilNumbersInRange = findEvilNumbersInRange(startRange, endRange);
// Output the results
console.log(`Evil numbers in the range ${startRange} to ${endRange}:`);
console.log(evilNumbersInRange.join(' '));
π» Testing the Program
The provided code is configured to find Evil Numbers in the range from 1 to 10. You can adjust the range by modifying the values of startRange and endRange.
Evil numbers in the range 1 to 10: 3 5 6 9 10
Run the script to see the Evil Numbers within the specified range.
π§ How the Program Works
- The program defines a function isEvilNumber to check if a given number is an Evil Number.
- Inside the function, it converts the number to its binary representation and counts the number of '1' bits.
- The findEvilNumbersInRange function iterates through the specified range, calling isEvilNumber for each number, and collects Evil Numbers.
- The driver program defines the range from 1 to 10, calls the function, and outputs the Evil Numbers.
π§ Understanding the Concept of Evil Number
Before delving into the code, let's understand the concept of Evil Numbers. An Evil Number is a non-negative integer that has an even number of '1' bits in its binary representation.
π’ Optimizing the Program
While the provided program is effective, consider exploring and implementing alternative approaches or optimizations for checking Evil Numbers.
Feel free to incorporate and modify this code as needed for your specific use case. Happy coding!
π¨βπ» Join our Community:
Author
For over eight years, I worked as a full-stack web developer. Now, I have chosen my profession as a full-time blogger at codetofun.com.
Buy me a coffee to make codetofun.com free for everyone.
Buy me a Coffee
If you have any doubts regarding this article (JavaScript Program to Check Evil Number), please comment here. I will help you immediately.