(k) Write a function to compute the greatest common divisor given by Euclid’s algorithm, exemplified for J = 1980, K = 1617 as follows:
1. A 5-digit positive integer is entered through the keyboard, write a function to calculate sum of digits of the 5-digit number: using recursion
Comments
Post a Comment