Question

write an algoritm to accept an integr and display its digits .continue the digit till the palindrome is not found.

Answer 1

what have you figured out so far?

Answer 2

n = num;
rev = 0;
while (num > 0)
{
dig = num % 10;
rev = rev * 10 + dig;
num = num / 10;
}

If n == rev then num is a palindrome:

cout << "Number " << (n == rev ? "IS" : "IS NOT") << " a palindrome" << endl