BUCKET SORT ALGORITMI

##article.authors##

  • Onarqulov Maqsadjon Karimberdiyevich ##default.groups.name.author##
  • Abdulhafizov Ibrohim Husanjon o’g’li ##default.groups.name.author##

##semicolon##

bucket sort, saralash algoritmi, taqsimlash orqali saralash, chiziqli vaqt murakkabligi, ma’lumotlar tuzilmalari, algoritm murakkabligi, bin sort, uniform taqsimot, vaqt murakkabligi, xotira murakkabligi

##article.abstract##

Ushbu maqola Bucket Sort (chelakli saralash) algoritmi haqida batafsil ma’lumot berishga qaratilgan. Bucket Sort - bu massiv elementlarini bir nechta bucket (chelak) yoki guruhlarga taqsimlash orqali ishlaydigan saralash algoritmidir. Har bir chelak alohida saralanadi, so’ngra chelaklardagi saralangan elementlar birlashtirilib, yakuniy tartiblangan massiv hosil qilinadi. Maqolada algoritmning asosiy tamoyillari, ishlash prinsipi, murakkablik tahlili, afzalliklari, kamchiliklari va amaliy qo’llanilish sohalari ko’rib chiqiladi. Shuningdek, algoritmning C# dasturlash tilidagi amaliy namunasi keltiriladi.

##submission.authorBiographies##

  • Onarqulov Maqsadjon Karimberdiyevich

    Farg’ona davlat universiteti amaliy matematika va

    informatika kafedrasi dotsenti (PhD)

    maxmaqsad@gmail.com

  • Abdulhafizov Ibrohim Husanjon o’g’li

    Farg’ona davlat universiteti 2-kurs talabasi

    ibrohimabdulhafizov33@gmail.com

##submission.downloads##

##submissions.published##

2025-05-27

##issue.issue##

##issue.vol## 26 ##issue.no## 8 (2025): Modern education and development

##section.section##

Articles

##submission.howToCite##

BUCKET SORT ALGORITMI. (2025). Modern Education and Development, 26(8), 223-232. https://scientific-jl.com/mod/article/view/16743