Repository files navigation

Implementation of the 196-algorithm to find palindromes in an iteratively computed number sequence.

Inspired byhttps://www.youtube.com/watch?v=bN8PE3eljdA&t=374s

git clone https://github.com/NumericalMax/196-algorithm.gitcd 196-algorithmg++ main.cpp -o main./main

Given a number n we iteratively reassign to n the sum of n and the reverse of n until n is a palindrome.

Example Given:

n = 19 // no palindrome, iteration = 0n = 19 + 91 = 110 // no palindrome, iteration = 1n = 110 + 11 = 121 // palindrome, iteration = 2

Note, that n is of type int. This can result in exceeding the allocated storage size for larger n or higher iterations. To prevent, you can set the datatype to long or a much larger datatype.