JS Topics
- JS Intro
- JS File Handling
- JS Array Methods
- JS Console Methods
- JS Date Methods
- JS Navigator Methods
- JS Node Methods
- JS Number Methods
- JS String Properties
- JS String Methods
- JS Window Methods
- JS Cookies
- JS Interview Programs
- Abundant Number
- Amicable Number
- Armstrong Number
- Average of N Numbers
- Automorphic Number
- Biggest of three numbers
- Binary to Decimal
- Common Divisors
- Composite Number
- Condense a Number
- Cube Number
- Decimal to Binary
- Decimal to Octal
- Disarium Number
- Even Number
- Evil Number
- Factorial of a Number
- Fibonacci Series
- GCD
- Happy Number
- Harshad Number
- LCM
- Leap Year
- Magic Number
- Matrix Addition
- Matrix Division
- Matrix Multiplication
- Matrix Subtraction
- Matrix Transpose
- Maximum Value of an Array
- Minimum Value of an Array
- Multiplication Table
- Natural Number
- Number Combination
- Odd Number
- Palindrome Number
- Pascalβs Triangle
- Perfect Number
- Perfect Square
- Power of 2
- Power of 3
- Pronic Number
- Prime Factor
- Prime Number
- Smith Number
- Strong Number
- Sum of Array
- Sum of Digits
- Swap Two Numbers
- Triangular Number
- JS Star Pattern
- JS Number Pattern
- JS Alphabet Pattern
JavaScript Program to check Perfect Square
Photo Credit to CodeToFun
π Introduction
In the realm of programming, various mathematical problems challenge programmers to devise efficient solutions. One such problem is determining whether a given number is a perfect square.
A perfect square is a number that is the square of an integer, meaning it can be expressed as the product of an integer multiplied by itself.
In this tutorial, we'll explore a JavaScript program designed to check whether a given number is a perfect square or not.
π Example
Let's take a look at the JavaScript code that accomplishes this task.
// Function to check if a number is a perfect square
function isPerfectSquare(number) {
for (let i = 1; i * i <= number; i++) {
// If i * i is equal to the number, it's a perfect square
if (i * i === number) {
return true;
}
}
return false;
}
// Driver program
// Replace this value with your desired number
const testNumber = 16;
// Check if the number is a perfect square
if (isPerfectSquare(testNumber)) {
console.log(`${testNumber} is a perfect square.`);
} else {
console.log(`${testNumber} is not a perfect square.`);
}
π» Testing the Program
To test the program with different numbers, simply replace the value of testNumber in the code.
16 is a perfect square.
Run the script to see if the number is a perfect square.
π§ How the Program Works
- The program defines a function isPerfectSquare that takes a number as input and returns true if the number is a perfect square, and false otherwise.
- Inside the function, it iterates through integers starting from 1 until the square of the current integer is greater than the given number.
- If the square of the current integer is equal to the given number, the function returns true indicating a perfect square.
- The main program then checks if a specific number (in this case, 16) is a perfect square and logs the result.
π Between the Given Range
Let's take a look at the javascript code that checks for perfect squares in the specified range.
// Function to check if a number is a perfect square
function isPerfectSquare(number) {
let sqrt = Math.sqrt(number);
return sqrt - Math.floor(sqrt) === 0;
}
// Driver program
function findPerfectSquaresInRange(start, end) {
let perfectSquares = [];
for (let i = start; i <= end; i++) {
if (isPerfectSquare(i) && i !== 1) {
perfectSquares.push(i);
}
}
return perfectSquares;
}
// Define the range
const startRange = 1;
const endRange = 50;
// Call the function to find perfect squares
const perfectSquaresInRange = findPerfectSquaresInRange(startRange, endRange);
// Display the result
console.log(`Perfect Squares in the range ${startRange} to ${endRange}:`);
console.log(perfectSquaresInRange.join(' '));
π» Testing the Program
The provided program checks for perfect squares in the range from 1 to 50. You can modify the range by changing the values of startRange and endRange in the code.
Perfect Squares in the Range 1 to 50: 1 4 9 16 25 36 49
Run the script to see the perfect squares in the specified range.
π§ How the Program Works
- The program defines a function isPerfectSquare that checks if a given number is a perfect square.
- Another function findPerfectSquaresInRange iterates through the specified range and identifies perfect squares.
- The main part of the program calls these functions and displays the result in the specified output format.
π§ Understanding the Concept of Perfect Square
Before diving into the code, let's take a moment to understand the concept of perfect squares.
A perfect square is a number that can be expressed as the product of an integer multiplied by itself.
For example, 4, 9, and 16 are perfect squares because they are the squares of 2, 3, and 4, respectively.
π’ Optimizing the Program
While the provided program is effective, there are alternative methods for checking perfect squares that involve mathematical properties. Consider exploring and implementing such optimizations to enhance the efficiency of your program.
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 Perfect Square), please comment here. I will help you immediately.