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

TARMOQLAN ISH VA BOG’LANISH ALGORITMALARI.

Articles
Published 2025-04-28
Abdullayev Shaxboz Solijon o‘g‘ili
FarDU Axborot texnologiyala ri kafedrasi katta o‘qtuvchisi
Hayitboyeva Sarvinoz Xabibullo qizi
FarDU Axborot tizimlari va tehnologiyalari yo‘nalishi 1-kurs talabasi
PDF

Keywords

tarmoqlanish, bogʻlanish, shart operatori, algoritm, tanlov, ketma-ketlik, qaror qabul qilish, shartli ifoda, dasturlash, funksiya chaqiruvi.

Abstract

Tarmoqlanish va bogʻlanish algoritmlari — bu hisoblash jarayonida shartlarga qarab turli yo‘nalishlarda bajariladigan algoritmlardir. Tarmoqlanish algoritmlari ma‘lum bir shart asosida turli holatlarni tanlaydi, bogʻlanish algoritmlari esa bir nechta alohida qismlarni ketma-ket yoki shartli tarzda bogʻlaydi. Bunday algoritmlar dasturlashda qaror qabul qilish va murakkab vazifalarni hal etishda muhim ahamiyatga ega.

PDF

References

. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to Algorithms (3rd ed.). MIT Press.

2. Kleinberg, J., & Tardos, E. (2006). Algorithm Design. Addison-Wesley.

3. Tarjan, R. E. (1983). Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics.

4. Dijkstra, E. W. (1959). A Note on Two Problems in Connexion with Graphs. Numerische Mathematik, 1(1), 269–271.

5. Sedgewick, R., & Wayne, K. (2011). Algorithms (4th ed.). Addison-Wesley.

6. Page, L., Brin, S., Motwani, R., & Winograd, T. (1999). The PageRank Citation Ranking: Bringing Order to the Web. Stanford InfoLab.

7. Knuth, D. E. (1997). The Art of Computer Programming, Volume 1: Fundamental Algorithms (3rd ed.). Addison-Wesley.

8. Bollobás, B. (2001). Random Graphs (2nd ed.). Cambridge University Press.