Turg„unmas saralash algoritmlari.
1.Tanlash orqali saralash(Selection sort) algoritmmurakkabligiO(n
2
)
2. Shell saralash (Shell sort) algoritm murakkabligi O(n log
2
n).
3. Tarash orqali saralash (Comb sort) algoritm murakkabligi O(nlogn)
4. Suzuvchi saralash (Smooth sort) algoritm murakkabligi O(n logn)
5. Tez saralash (Quick sort) algoritm murakkabligi O(nlogn)
6. Intro sort – algoritm murakkabligi O(nlogn)
7. Patience sorting – algoritm murakkabligi O(nlogn)
8. Stooge sort – algoritm murakkabligi O(n
2.71
)
9. Razryadli saralash. Algoritm murakkabligi O(n+k). O(k)qo„shimcha xotira
talab etiladi.
Do'stlaringiz bilan baham: |