Anibel - Integer Palindrome Check - Edges

[anibelamerica]

The time complexity for this implementation of an integer palindrome check is linear or O(n) where n is equal to the number of place values of the input number argument. In this implementation, a copy of the number is saved and then reversed. At the earliest (aside from edge or basic scenarios of a nil, 0 <= number < 10, negative input), n/2 comparisons could be made before confirming an integer palindrome. Otherwise, the program will run n comparisons before completion.

The space complexity for this program is O(1) or constant since it will always track 2 variables (integers) for the duration of the program.