What is the algorithm for reverse a given number recursively?

Answer 1

//Function that reverses a given number

int reverse(int num)

{

static int sum,base =1;

sum=0;

if(num>0)

{

reverse(num/10);

sum += (num%10)*base;

base*=10;

}

return sum;

}

Answer 2

Assuming you want to reverse the digits of the number:

numToReverse <- the number we want to reverse

revNum <- new number as numToReverse is reversed

while numToReverse is not 0

// shift digits left

revNum = revNum * 10

// tack on rightmost digit of numToReverse

revNum = revNum + (numToReverse modulus 10)

// shift digits right

numToReverse = numToReverse / 10

// numToReverse is now 0

// revNum is now the reverse of (the original value of) numToReverse

Answer 3

#include<stdio.h>

#include<conio.h>

int rev(int n);

void main()

{

int n;

clrscr();

printf("Enter the n value\n");

scanf("%d",&n);

printf("The reverse number is %d",rev(n));

getch();

}

int rev( int n)

{

int re;

int dig;

if (n==0)

{

return 0;

}

dig=n%10;

n=n/10;

re=digit+10*re(n);

return re;

}

return 1;

Answer 4

Call your reversal function reverse().

If you have an empty string, return the empty string (this is the condition for ending recursion). You can also end the recursion when your string has a length of a single character (return the single character), but you must still account for the possibility of empty strings.

Otherwise, separate the string into two parts: for example, the first letter, and the remaining string (see Note 1). Return the reverse() of the second part, joined to the reverse() of the first part.

For example, if your string is "abc", your function would have to return reverse("bc") + reverse("a"). reverse("bc") will, in turn, result in reverse("c") + reverse("b"), so the result will be "cba".

Answer 5

Do it with recursion!

void rev (int n)

{

putchar ('0'+n%10);

n/=10;

if (n) rev (n);

}

Answer 6

how to use recursive function to top level child reverse

Answer 7

Yes, do.