This algorithm was made to find a solution to the problem of finding the square root of a given integer $($that is guaranteed to be a square$).$

procedure findSquareRoot$()$

num :$=1$

while$($num$)$

if $($num $*$ num$)=$ a

return num $\{$num is the square root of the given integer$\}$

else

num $=$ num $+1$

Which property does this algorithm lack?

Group of answer choices

Definiteness

Finiteness

Input

Effectiveness

Output