Program to find LCM without GCD using if condition

this program finds the LCM of two numbers finding the highest among two numbers.

then check that highest values is divisible by both numbers. if divisible it is LCM if not increment highest value and again check the condition repeat this process until you find LCM

[lourembamibotombi]

I want a Algorithm for finding square root of integer in c