An Efficient Algorithm for the Solution of Ackermann Function

One of the main problems for running recursive functions with high rate of growth is execution time and memory spaces, in which case we can not run the program. In addition many commonly used programming languages do not allow recursive programs. This study presents an efficient algorithm for Ackermann recursive function. The algorithm is tested by comparing with recursive function in high level language such as Pascal.