The given program finds the gcd of the two numbers using long division method recursively . We can show it here :
tech (15 , 4) ==> tech (4 , 15 % 4) = tech (4 , 3)
==> tech(3 , 4 % 3) = tech(3,1)
==> tech(3 , 1) = 1 as 3 % 1 == 0
Hence return value of the function is 1.
Also if we see gcd(15,4) , it is also 1.
Hence the output of the given program is 1 .