Abstract
Ushbu ilmiy maqola zamonaviy C++ (C++11, C++14, C++17, C++20 standartlari) da chiziqli ma'lumotlar strukturalarining ilg'or usullari bilan ishlashga bag'ishlangan. Maqola nafaqat klassik STL konteynerlarini, balki ularning ichki ishlash mexanizmlari, xotira boshqaruvi, iteratorlar va parallel ishlash usullarini chuqur o'rganadi. Har bir bo'limda amaliy loyihalarda uchraydigan muammolar va ularning yechimlari bilan bog'liq detalli misollar keltirilgan. Maqola professional dasturchilar, ma'lumotlar strukturalari bo'yicha tadqiqot olib borayotgan talabalar hamda algoritmlar muxlislari uchun qimmatli resurs hisoblanadi.
References
1. Abelson, H., & Sussman, G. J. Structure and Interpretation of Computer Programs MIT Press, 2nd Edition, 1996.
2. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. Introduction to Algorithms MIT Press, 3rd Edition, 2009.
3. Sedgewick, R., & Wayne, K. Algorithms (4th Edition) Addison-Wesley, 2011.
4. Lafore, R. Data Structures and Algorithms in Java Sams Publishing, 2002.
5. Python Software Foundation The Python Standard Library – Collections Module (Deque, List, etc.) https://docs.python.org/3/library/collections.html
6. Forouzan, B. A. Data Structures: A Pseudocode Approach with C Cengage Learning, 2nd Edition, 2003.
7. Tanenbaum, A. S. Structured Computer Organization Pearson, 6th Edition, 2013.