Write a program for the prime-number-finder problem in, but use a dynamically allocated array.
Write a program to add two large integers with up to 300 digits. One approach is to treat each number as a list, each of whose elements is a block of digits of that number. For example, the integer 179,534,672,198 might be stored with block [O] =198, block[l] =672, block[2] = 534, block[3] = 179. Then add two integers (lists), element by element, carrying from one element to the next when necessary.