Algorithm for finding sum of very large Integers
- Read input as objects of type String
- Convert String Objects in to character arrays
- Convert the character array to integer array. (i.e)character ’1’ is converted as numeric digit ‘1’ by subtracting ascii values
- Strat the process of addition from the right end of both the arrays. If the result is greater than 9, use modulo arithmetic to retrieve Least significant digit.
- Carry over the addition to next cells; towards the left end of both the arrays recursively.
- The size of result array is equal to or one more than the size of the largest input string.