Increasing the Speed of the Recursive Algorithm and Reducing Stack Memory Consumption by Using the Dynamic Rule(base)

Abstract

Recursive algorithms always consume a computer's memory stack, and in
this paper we worked to increase the speed of the recursive algorithmthrough a dynamic rule(base) that changes during its implementation
process. Dynamic rule(base) regulation often allows avoiding repeated
calculations of the same sets of parameter values, which reduces the number
of repeated calls and simplifies slow calculations. Here, a mechanism will
be created for the rule using simple and well-known examples to calculate
the Fibonacci sequence, recurring linear sequences of general shape, and
binomial transactions.