Question

16. Here below is the skeleton of the function for reversing digits. Finish the function definition. (10 pts) int reversDigits (int num) int rev-num = 0; //the reversed digits While Cnum >10 ) 2 17. Rewrite the above function applying recursive function (10 pts)

Answer 1

int sum=0,rem;
rev_fn(int num){
   if(num){                   //if number is not zero then it is true
      rem=num%10;             //claculate reminder
      sum=sum*10+rem;         //sum will store the reverse number atlast
      rev_fn(num/10);        //recursive function
   }
   else
      return sum;            //when num becomes zero return sum
   return sum;
}

Program and OUTPUT:

Explanation: