Given an integer, determine if it is a Palindrome in less than O(n) [on hold]
- by user134235
There is an O(n) solution to the problem of determining if an integer is a palindrome below. Is it possible to solve this problem in O(log n) or better?
static void IsPalindrome(int Number)
{
int OrignalNum = Number;
int Reverse = 0;
int Remainder = 0;
if (Number > 0)
{
while (Number > 0)
{
Remainder = Number % 10;
Reverse = Reverse * 10 + Remainder;
Number = Number / 10;
}
if (OrignalNum == Reverse)
Console.WriteLine("It is a Palindrome");
else
Console.WriteLine("It is not a Palindrome");
}
else
Console.WriteLine("Enter Number Again");
}
