Find if number is square
Describe an alogrithm to find out if an integer is a square
Given an integer n, write a function that returns count of trailing zeroes in n!. Examples: Input: n = 5 Output: 1 Factorial of 5 is 20 which has one trailing 0. Input: n = 20 Output: 4 Factorial of 20 is 2432902008176640000 which has 4 trailing zeroes. Input: n = 100 Output: 24
bool isSquare(int n)
ReplyDelete{
int i=1, temp=n;
while(temp>=0)
{
if(temp==0) return true;
temp=temp-i;
//increment by 2 to get only odd
//combination
i=i+2;
}
return false;
}
this is by property of a square i.e 1+3+5+7+..(only odd terms) = n^2
ReplyDelete