DASTURLASHDA CHIZIQLI QIDIRUV

Authors

  • Ro‘ziqulova Maqsuda Abriy qizi Muhammad al-Xorazmiy nomidagi TATU Qarshi filiali assistenti Author

Keywords:

Chiziqli qidiruv, algoritm, dasturlash, qidiruv algoritmlari, ma’lumotlar tuzilmasi, massiv, C++ dasturlash tili, samaradorlik, dasturiy ta’minot.

Abstract

Ushbu maqolada dasturlashda keng qo‘llaniladigan chiziqli qidiruv algoritmi tahlil qilinadi. Chiziqli qidiruv – oddiy va universal algoritm bo‘lib, funksiyalarga cheklovlarsiz har qanday qiymatni izlash imkonini beradi. Maqolada chiziqli qidiruvning ishlash prinsipi, samaradorligi, afzalliklari va kamchiliklari ko‘rib chiqilgan. Shuningdek, algoritmning dasturiy realizatsiyasi C++ dasturlash tili misolida keltirilgan. Chiziqli qidiruv kichik hajmdagi ma’lumotlar ustida ishlashda samarali bo‘lsa-da, katta ma’lumotlar to‘plamida uning samaradorligi nisbatan pasayishi mumkin. Ushbu maqola chiziqli qidiruv algoritmini tushunishni va uni amaliyotda qo‘llashni osonlashtiradi.

References

Bhargava, A. Grokking Algorithms: An illustrated guide for programmers and other curious people. Manning Publications, 2016.

1. Dasgupta, S., Papadimitriou, C., & Vazirani, U. Algorithms. McGraw-Hill Education, 2021 (revised edition).

2. Roughgarden, T. Algorithms Illuminated (Parts 1-4). Soundlikeyourself Publishing, 2017-2020.

3. Heineman, G. T. Algorithms in a Nutshell: A Practical Guide. O’Reilly Media, 2020.

4. Skiena, S. S. The Algorithm Design Manual. Springer, 2020 (3rd edition).

5. Bhimani, N. Hands-On Data Structures and Algorithms with C++. Packt Publishing, 2018.

6. Brassard, G., & Bratley, P. Fundamentals of Algorithmics. Pearson, 2020 (updated edition).

7. Roy, P. Data Structures and Algorithms with Python. Packt Publishing, 2020.

8. Mukherjee, S. Data Structures and Algorithms in C++. BPB Publications, 2021.

9.

Downloads

Published

2025-02-01

How to Cite

DASTURLASHDA CHIZIQLI QIDIRUV. (2025). ZAMONAVIY TA’LIM TIZIMINI RIVOJLANTIRISH VA UNGA QARATILGAN KREATIV G’OYALAR, TAKLIFLAR VA YECHIMLAR, 7(75), 260-262. https://uzconferences.org/index.php/uzconf/article/view/498