Mavzu: Piramidali saralash algoritmlari Mundarija

if (L < j) qsort(L, j);
if (i < R) qsort(i, R);
}
int main() {
int n;
cin>>n;
for (int i = 0; i < n; i++)
cin>>a[i];
qsort(0, n-1);
for (int i = 0; i < n; i++)
cout<return 0;
}
Agar bo’luvchi elementni o’rtadan emas, balki [L, R] kesmadan ixtiyoriy tanlab olinsa ishlash vaqti O(nlong(n)).
Turg’un saralash algoritmlari.
1. Tanlashni saralash (Selection sort) – algoritm murakkabligi O(n² )
2. Ko’pikli saralash (Bubble sort) – algoritm murakkabligi O(n² ).
3. Aralashtirish saralashi (SHeyker, Cocktail sort, bidirectional bubble sort) - algoritm murakkabligi O(n²)
4. O’rniga qo’yish saralashi (Insertion sort) – algoritmmurakkabligi O(n² )
5. Qo’shilishsaralashi (Merge sort) – algoritmmurakkabligi O(n logn)
6. Ikkilikdaraxtiyordamidasaralash (Tree sort) – algoritmmurakkabligi O(n log n) qo’shimcha O(n) xotiratalabetadi.
7. Timsortsaralashi (Timsort) – algoritmmurakkabligi O(n log n) qo’shimcha O(n) xotiratalabetadi.
8. Sanashorqalisaralash (Counting sort) – algoritmmurakkabligi O(n+k) qo’shimcha O(n) xotiratalabetadi.
9. Bloklisaralash (Savatlisaralash, Bucket sort) – algoritmmurakkabligi O(n) qo’shimcha O(k) xotiratalabetadi
Turg’unmas saralash algoritmlari.
1.Tanlash orqali saralash(Selection sort) algoritmmurakkabligiO(n² )
2. Shell saralash (Shell sort) algoritm murakkabligi O(n log₂ 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.