Find the Reverse of a Number

When a number is reversed, the digits are rearranged in reverse order, starting with the last digit, then the second-to-last digit, and so on, with the first digit appearing last.

Program Code:

#include <iostream>
using namespace std;

/* Iterative function to reverse digits of num*/
int reverseDigits(int num)
{
	int rev = 0;
	while (num > 0) {
		rev = rev * 10 + num % 10;
		num = num / 10;
	}
	return rev;
}

/*Driver program to test reverseDigits*/
int main()
{
	int num ;
	cin>> num;
    cout<<"Reverse of no. is " << reverseDigits(num);

	getchar();
	return 0;
}

Output:

45821
Reverse of no. is12854

Note: also read about Armstrong Number in C++

Follow Me

Please follow me to read my latest post on programming and technology if you like my post.

https://www.instagram.com/coderz.py/

https://www.facebook.com/coderz.py