|
O‘zbekistonda fanlararo innovatsiyalar
|
| bet | 5/5 | | Sana | 12.06.2024 | | Hajmi | 0,96 Mb. | | #262783 |
Bog'liq Raxmonova M.R.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:
https://proglib.io/p/sravnenie-6-algoritmov-sortirovki-puzyrkom-vyborom- kuchey-vstavkami-sliyaniem-i-bystraya-2022-02-08
https://www.geeksforgeeks.org/comparison-among-bubble-sort-selection- sort-and-insertion-sort/
https://www.geeksforgeeks.org/heap- sort/#:~:text=Heap%20sort%20is%20a%20comparison,process%20for%20th e%20remaining%20elements
https://www.geeksforgeeks.org/insertion-sort/
https://www.geeksforgeeks.org/merge-sort/
https://www.geeksforgeeks.org/quick-sort/
|
| |
