#include<stdio.h>
#include<math.h>
int rev(int n)
{
int digit=(int)log10(n); ///finding the length of the integer
if(n==0) ///base case
{
return 0;
}
else
{
return (n%10*pow(10,digit) + rev(n/10) ); ///Recursion
}
}
int main()
{
int n;
printf("Please Enter A Value: ");
scanf("%d",&n);
int ans=rev(n);
printf("
Reverse: %d
",ans);
return 0;
}
Output
Please Enter A Value: 123
Reverse: 321
Add your comment