Vol. 2 No. 8 (2025), Articles
Vol. 2 No. 8 (2025)

C++ DA REKURSIV ALGORITMLARNI OPTIMALLASHTIRISH: TAIL RECURSION VA MEMOIZATION

Articles
Published 2025-05-13
Abdullayev Shaxboz Solijon o‘g‘li
FarDU Axborot texnologiyalari kafedrasi katta o'qituvchisi
Tojimamatov Soxibjon Sherzodbek oʻgʻli
Farg‘ona davlat universiteti talabasi
PDF

Keywords

Ushbu maqolada C++ dasturlash tilida rekursiv algoritmlarni optimallashtirish usullari, xususan Tail Recursion va Memoization texnikalari batafsil tadqiq etilgan. Zamonaviy C++17 va C++20 standartlari doirasida ushbu texnikalarning samaradorligi tahlil qilinib, ularning kombinatsiyali qo'llanilishi taklif etilgan. Tadqiqot natijalariga ko'ra, faktorial hisoblash, Fibonacci ketma-ketligi va dinamik dasturlash masalalarida klassik rekursiv yondashuvga nisbatan sezilarli darajada (15% dan 99.7% gacha) tezlik va xotiradan foydalanish samaradorligi oshishi kuzatilgan. Maqolada shuningdek g++, clang va MSVC kompilyatorlarining tail rekursiyani optimallash xususiyatlari solishtirilgan, zamonaviy C++ xususiyatlaridan foydalanib rekursiv algoritmlarni optimallashtirishning yangi usullari taklif etilgan.

Abstract

Ushbu maqolada C++ dasturlash tilida rekursiv algoritmlarni optimallashtirish usullari, xususan Tail Recursion va Memoization texnikalari batafsil tadqiq etilgan. Zamonaviy C++17 va C++20 standartlari doirasida ushbu texnikalarning samaradorligi tahlil qilinib, ularning kombinatsiyali qo'llanilishi taklif etilgan. Tadqiqot natijalariga ko'ra, faktorial hisoblash, Fibonacci ketma-ketligi va dinamik dasturlash masalalarida klassik rekursiv yondashuvga nisbatan sezilarli darajada (15% dan 99.7% gacha) tezlik va xotiradan foydalanish samaradorligi oshishi kuzatilgan. Maqolada shuningdek g++, clang va MSVC kompilyatorlarining tail rekursiyani optimallash xususiyatlari solishtirilgan, zamonaviy C++ xususiyatlaridan foydalanib rekursiv algoritmlarni optimallashtirishning yangi usullari taklif etilgan.
PDF

References

1. Bjarne Stroustrup. (2022). The C++ Programming Language, 5th Edition. Addison-Wesley Professional.

2. Scott Meyers. (2021). Effective Modern C++: 42 Specific Ways to Improve Your Use of C++11 and C++14. O'Reilly Media.

3. Alexander A. Stepanov, Daniel E. Rose. (2018). From Mathematics to Generic Programming. Addison-Wesley Professional.

4. Anthony Williams. (2019). C++ Concurrency in Action, 2nd Edition. Manning Publications.

5. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein. (2022). Introduction to Algorithms, 4th Edition. MIT Press.

6. Nicolai M. Josuttis. (2022). C++20 - The Complete Guide. Nicolai M. Josuttis.

7. Ivan Čukić. (2023). Functional Programming in C++. Manning Publications.

8. Daniel Saks. (2020). "Tail Recursion Optimization in Modern C++ Compilers," Proceedings of CppCon 2020, pp. 178-192.

9. Andrei Alexandrescu. (2021). "Modern C++ Design Patterns for Performance Critical Applications," Journal of Software Engineering and Applications, Vol. 14, No. 3, pp. 89-105.

10. David Vandevoorde, Nicolai M. Josuttis, Douglas Gregor. (2022). C++ Templates: The Complete Guide, 2nd Edition. Addison-Wesley Professional.

11. Herb Sutter. (2023). "Zero-Overhead C++: Benchmarking Modern Optimization Techniques," IEEE Software, Vol. 40, No. 2, pp. 67-75.

12. Yury Gribov. (2021). "Memory Efficiency in Recursive Algorithms: Modern Approaches," ACM Computing Surveys, Vol. 53, No. 4, pp. 1-35.

13. Alexey Voinov, Sergey Ignatchenko. (2023). "Energy Efficient Programming in C++20: Analysis of Recursive Algorithms," International Journal of Green Computing, Vol. 14, No. 1, pp. 23-41.

14. Lisa Liu, Mark Nelson. (2022). "Comparison of Memoization Techniques in Modern C++," Proceedings of the ACM SIGPlan Conference on Programming Language Design and Implementation (PLDI '22), pp. 312-326.

15. James McNellis, Stephan T. Lavavej. (2023). "Compile-time Optimization Techniques for Recursive Templates in C++20," ACM Transactions on Programming Languages and Systems, Vol. 45, No. 2, pp. 112-148.