Xulosa. Saralash algoritmi Sorting algoritmi

Xotiradan foydalanish tartibi va indekslarni saralash
Tartibga solinadigan massivning hajmi mavjud bo'lgan asosiy xotiraga yaqinlashganda yoki undan oshib ketganda (juda sekinroq) disk yoki almashtirish maydoni ishlatilishi kerak bo'lsa, tartiblash algoritmining xotiradan foydalanish tartibi muhim ahamiyat kasb etadi va algoritm juda adolatli bo'lishi mumkin edi. Qator RAMga osonlikcha sig'adigan bo'lsa, samarasiz bo'lishi mumkin. Ushbu stsenariyda taqqoslashlarning umumiy soni (nisbatan) unchalik ahamiyatli bo'lmaydi va xotira qismlarining diskka nusxa ko'chirilishi yoki almashtirilishi va algoritmning ishlash xususiyatlarida ustunlik qilishi mumkin bo'lgan soni. Shunday qilib, o'tish soni va taqqoslashning lokalizatsiyasi taqqoslashning dastlabki sonidan ko'ra muhimroq bo'lishi mumkin, chunki yaqin atrofdagi elementlarni bir-biriga taqqoslash sodir bo'ladi tizim avtobusi tezlik (yoki keshlash bilan, hatto Markaziy protsessor disk tezligi bilan taqqoslaganda deyarli bir zumda).
Masalan, mashhur rekursiv tezkor algoritm etarli RAM bilan etarli darajada oqilona ishlashni ta'minlaydi, ammo massivning qismlarini nusxalashning rekursiv usuli tufayli qator RAMga mos kelmasa, unchalik amaliy bo'lmaydi, chunki bu bir qator sekin nusxalashga yoki operatsiyalarni ko'chirishga olib kelishi mumkin. diskdan. Ushbu stsenariyda, agar ko'proq taqqoslashni talab qiladigan bo'lsa ham, boshqa algoritm afzalroq bo'lishi mumkin.
Murakkab yozuvlar paytida yaxshi ishlaydigan ushbu muammo ustida ishlashning bir usuli (masalan, a relyatsion ma'lumotlar bazasi) nisbatan kichik kalit maydon bo'yicha saralanmoqda, massivda indeks yaratish va keyin butun qatorni emas, indeksni saralash. (Keyinchalik butun massivning tartiblangan versiyasi indeksdan o'qish bilan bitta o'tish yo'li bilan ishlab chiqarilishi mumkin, lekin ko'pincha bu keraksiz, chunki tartiblangan indeks etarli bo'ladi.) Indeks butun massivdan ancha kichik bo'lgani uchun diskni almashtirish muammosini samarali ravishda yo'q qilib, butun massiv ishlamaydigan xotiraga osongina joylashadi. Ushbu protsedura ba'zan "yorliqlarni saralash" deb nomlanadi.^[36]
Xotira hajmi muammosini bartaraf etishning yana bir usuli qo'llaniladi tashqi tartiblash, for example one of the ways is to combine two algorithms in a way that takes advantage of the strength of each to improve overall performance. For instance, the array might be subdivided into chunks of a size that will fit in RAM, the contents of each chunk sorted using an efficient algorithm (such as tezkor), and the results merged using a k-way merge similar to that used in mergesort. This is faster than performing either mergesort or quicksort over the entire list.^[37][38]
Techniques can also be combined. For sorting very large sets of data that vastly exceed system memory, even the index may need to be sorted using an algorithm or combination of algorithms designed to perform reasonably with virtual xotira, i.e., to reduce the amount of swapping required.
Tegishli algoritmlar
Bunga tegishli muammolar kiradi partial sorting (sorting only the k smallest elements of a list, or alternatively computing the k smallest elements, but unordered) and tanlov (computing the kth smallest element). These can be solved inefficiently by a total sort, but more efficient algorithms exist, often derived by generalizing a sorting algorithm. The most notable example is tez tanlashbilan bog'liq bo'lgan tezkor. Conversely, some sorting algorithms can be derived by repeated application of a selection algorithm; quicksort and quickselect can be seen as the same pivoting move, differing only in whether one recurses on both sides (quicksort, bo'ling va zabt eting) or one side (quickselect, decrease and conquer).
A kind of opposite of a sorting algorithm is a shuffling algorithm. These are fundamentally different because they require a source of random numbers. Shuffling can also be implemented by a sorting algorithm, namely by a random sort: assigning a random number to each element of the list and then sorting based on the random numbers. This is generally not done in practice, however, and there is a well-known simple and efficient algorithm for shuffling: the Fisher-Yeyts aralashmasi.
Shuningdek qarang

• 
  Harmanlama – Assembly of written information into a standard order
  
• 
  Schwartzian transform
  
• 
  Qidiruv algoritmi – Any algorithm which solves the search problem
  
• 
  Kvant saralash – Sorting algorithms for quantum computers
  

Xulosa:
Insertion sort algoritmi orqali Respublikamizdagi viloyatlar maydonini o’sish tartibida joylashtirish haqida tushunchalar oldim. Bugungi axborot texnologiyalari tez o’sib borayotgan davrda ularning “ Ma’lumotlar tuzilmasi va algoritmlar” fanidagi o’rni bilan tanishdim.Va o’z bilimlarimni yanada boyitdim.
Foydalanilgan internet saytlari:

1. 
   http://www.intuit.ru
   
2. 
   http://ziyonet.uz
   
3. 
   https://lib.samtuit.uz
   
4. 
   https://uz.wikiaro.ru