تحليل طريقة تقليل عدد العمليات الحسابية والمنطقية عن طريق إدخال علاقات تكرارية إضافية إلى الخوارزميات

This paper handles the method of improving the computational complexity of algorithms by inserting additional recurrence formulas in order to decrease the arithmetical and logical operations. Consequently, execution speed increases. So, this method is not always active because the additional recurrence formulas increases the variables in the algorithms and this, in turn, has an opposite effect on execution speed. In this paper, the writer determines suitable states for using his method. The results were verified by implementing the algorithms in MATLAB R2006a language, and in C++ language (for algorithms which contained integer variables) and via designing a program to measure the execution time.