Keywords
Abstract
Ushbu maqola Binary Search qidirish algoritmini baholash va uning ahamiyatini o'rganadi. Binary Search – tartiblangan ma’lumotlar to‘plamida elementni tez va samarali topish uchun qo‘llaniladigan algoritmdir. Algoritm Divide and Conquer yondashuviga asoslanib, har bir qadamda qidirilayotgan elementni to‘plamning o‘rtasidan tekshiradi va kerakli tomonga yo‘naladi. Ushbu maqola Binary Search algoritmining ishlash prinsipi, murakkablik tahlili va amaliy qo‘llanilishi haqida batafsil ma’lumot beradi.References
1) Cormen T.H., Leiserson C.E., Rivest R.L., Stein C.
Introduction to Algorithms, MIT Press, 2009.
https://mitpress.mit.edu/books/introduction-algorithms
2) Knuth D.E.The Art of Computer Programming, Addison-Wesley, 1997.
https://www-cs-faculty.stanford.edu/~knuth/taocp.html
3) Sedgewick R., Wayne K.Algorithms, Pearson, 2011.
https://www.cs.princeton.edu/~rs/AlgsDSBook
4) Goodrich M.T., Tamassia R.
Data Structures and Algorithms in Java, Wiley, 2014.
https://www.wiley.com/en-us/Data+Structures+and+Algorithms+in+Java-p-9781118771334
5) Skiena S.S.
The Algorithm Design Manual, Springer, 2020.
6) Wikipedia - Binary Search Algorithm
https://en.wikipedia.org/wiki/Binary_search_algorithm
7) GeeksforGeeks - Binary Search
https://www.geeksforgeeks.org/binary-search/
8) Harvard CS50 - Search Algorithms https://cs50.harvard.edu/
9) Stanford Online - Algorithms Specialization