Massivlar ustida amalga oshiriladigan so‘rovlar tahlili
To‘xtasinov Dadaxon Farxodovich
Oriental universiteti
Abstract
Ushbu maqolada N ta elementdan iborat A massivlari va ular ustida bajariladigan so‘rovlar tahlil qilinadi. Asosiy e’tibor massiv uzunligini oshirish bilan bog‘liq 3-turdagi so‘rovlarga qaratiladi. Massivga element qo‘shish, elementni o‘zgartirish va so‘rovlarni qayta ishlashning algoritmik usullari ko‘rib chiqiladi. Shuningdek, dinamik operatsiyalarni samarali amalga oshirish va ularni optimallashtirish masalalari yoritiladi.
Kalit so‘zlar: massiv, so‘rovlar, algoritm, dinamik tuzilma, element qo‘shish, massiv uzunligini oshirish, optimallashtirish.
References
1. Cormen T. H., Leiserson C. E., Rivest R. L., Stein C. “Introduction to Algorithms”
2. Weiss M. A. Data Structures and Algorithm Analysis in C++. 4th edition, Pearson, 2013.
3. Sedgewick R., Wayne K. Algorithms. 4th edition, Addison-Wesley, 2011.
4. Skiena S. S. The Algorithm Design Manual. 2nd edition, Springer, 2008.
5. Horowitz E., Sahni S., Rajasekaran S. Computer Algorithms. 2nd edition, Silicon Press, 2007.
6. Knuth D. E. The Art of Computer Programming, Volumes 1-4A. Addison-Wesley, 2011.
