O‘zbekistonda fanlararo innovatsiyalar va 8-son ilmiy

Eng yaxshi holatda ish vaqti
Fazoviy murakkablik
Pufakchali tartiblash	n2	n2	n	bitta
Tanlash usuli	n2	n2	n2	bitta
Tez tartiblash	n2	n	n	n
Yig’ish usuli	n	n	n	bitta
Kiritish usuli	n2	n2	n	bitta
Birlashtirish usuli	n	n	n	n

Xulosa qilib aytish mumkinki, har bir saralash algoritmi o'ziga xos vaqt va makon murakkabligiga ega. Vazifalarga qarab, taqdim etilgan algoritmlarning biridan foydalanish mumkin. Lekin mening sub'ektiv fikrimcha, tez tartiblash eng yaxshi algoritmdir. U asosiy tayanch elementni tanlash imkonini beradi va massivni 3 qismga ajratadi: kichik, teng va tayanchdan katta.

FOYDALANILGAN ADABIYOTLAR RO’YHATI:

1. 
   https://proglib.io/p/sravnenie-6-algoritmov-sortirovki-puzyrkom-vyborom- kuchey-vstavkami-sliyaniem-i-bystraya-2022-02-08
   
2. 
   https://www.geeksforgeeks.org/comparison-among-bubble-sort-selection- sort-and-insertion-sort/
   
3. 
   https://www.geeksforgeeks.org/heap- sort/#:~:text=Heap%20sort%20is%20a%20comparison,process%20for%20th e%20remaining%20elements
   
4. 
   https://www.geeksforgeeks.org/insertion-sort/
   
5. 
   https://www.geeksforgeeks.org/merge-sort/
   
6. 
   https://www.geeksforgeeks.org/quick-sort/