C++ Program to check Perfect Square

Posted in C++ Tutorial

Updated on Oct 06, 2024

By Mari Selvan

👁️ 120 - Views

⏳ 4 mins

💬 1 Comment

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 C++ program designed to check whether a given number is a perfect square or not.

📄 Example

Let's dive into the C++ code that accomplishes this task.

isPerfectSquare.cpp

Copied

#include <iostream>

// Function to check if a number is a perfect square
bool isPerfectSquare(int number) {
  for (int 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
int main() {
  // Replace this value with your desired number
  int testNumber = 16;

  // Check if the number is a perfect square
  if (isPerfectSquare(testNumber)) {
    std::cout << testNumber << " is a perfect square." << std::endl;
  } else {
    std::cout << testNumber << " is not a perfect square." << std::endl;
  }

  return 0;
}

💻 Testing the Program

To test the program with different numbers, simply replace the value of testNumber in the main function.

Output

16 is a perfect square.

Compile and run the program to see if the number is a perfect square.

🧠 How the Program Works

The program defines a function isPerfectSquare that takes an integer 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 prints the result.

📏 Between the Given Range

Let's take a look at the C++ code that checks for perfect squares in the specified range.

isPerfectSquare.cpp

Copied

#include <iostream>
#include <cmath>

// Function to check if a number is a perfect square
bool isPerfectSquare(int num) {
  int squareRoot = sqrt(num);
  return squareRoot * squareRoot == num;
}

// Driver program
int main() {
  std::cout << "Perfect Squares in the range 1 to 50:\n";

  // Iterate through the range from 1 to 50
  for (int i = 1; i <= 50; ++i) {
    if (isPerfectSquare(i)) {
      std::cout << i << " ";
    }
  }

  std::cout << std::endl;

  return 0;
}

💻 Testing the Program

The program will output the perfect squares in the specified format:

Output

Perfect Squares in the Range 1 to 50:
1 4 9 16 25 36 49

🧠 How the Program Works

The program defines a function isPerfectSquare that checks if a given number is a perfect square.
Inside the main function, it iterates through the range from 1 to 50.
For each number, it calls the isPerfectSquare function and prints the number if it is a perfect square.

🧐 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!