Question

How to find the perfect square elements in an array with C++

Answer 1

#include <iostream>
#include <cmath>
 
bool is_perfect_square(double n) {
   double sq = sqrt(n);
 
   return ((sq - floor(sq)) == 0);
}
 
int main()
{
    int array[] = {7, 8, 9, 0, 36};
    int len = sizeof(array)/sizeof(array[0]);

    for (int i = 0; i < len; i++) {
        if (is_perfect_square(array[i])) {
            std::cout << array[i] << " : Yes" << "\n";
        }
        else {
            std::cout << array[i] << " : No" << "\n";
        }
    }
 
    return 0;
}
 
 
 
 
/*
run:
 
7 : No
8 : No
9 : Yes
0 : Yes
36 : Yes
 
*/

 

70+ SQL courses for beginners and professionals