AlgoYo‘l
Yo‘l xaritalari
Masalalar
Duel
Kontestlar
Reyting
Kompilyator
Do‘kon
UZ
Kirish
Ro‘yxatdan o‘tish
Yuklanmoqda…
⌂
Bosh
◈
Yo‘l
≡
Masala
⚔
Duel
◉
Profil
⋯
Ko‘proq
← Yo‘l xaritalari
↕
800 → 1500 · 525 min
Sorting algoritmlari
Sorting usullarini tanlash va qo‘llash.
Boshlash · Sorting nima uchun kerak
0%
o‘zlashtirildi
0/18 bosqich
Mahorat 0/1000 · Boshlanmagan
Bosqich 1
0/5
01
900 → 1100 · 15 min
Sorting nima uchun kerak
Saralash nima uchun kerak va qaysi masalalarda birinchi qadam ekanini tushunish.
Quiz 0%
Problem —
▶
Hozirgi
02
900 → 1100 · 17 min
Selection sort
Selection sort g‘oyasi, yozilishi va nima uchun kam yozish (swap) kerak bo‘lganda foydali ekanini bilish.
Quiz 0%
Problem —
○
Ochiq
03
900 → 1100 · 18 min
Bubble sort
Bubble sort g‘oyasi, erta-to‘xtash optimallashtiruvi va uning barqarorligini tushunish.
Quiz 0%
Problem —
○
Ochiq
04
1100 → 1300 · 20 min
Insertion sort
Insertion sort mexanikasi, deyarli-tartiblangan kiritishda O(n) yaqinligi va amaliy qo‘llanilishi.
Quiz 0%
Problem —
○
Ochiq
05
1200 → 1400 · 22 min
Counting sort
Counting sort: taqqoslamasdan saralash, qachon O(n + k) berishi va cheklovlarini bilish.
Quiz 0%
Problem —
○
Ochiq
Bosqich 2
0/5
06
1300 → 1500 · 23 min
Merge sort: bo‘lib-yengish
Merge sort: bo‘lib-yengish, birlashtirish (merge) va kafolatlangan O(n log n) tahlili.
Quiz 0%
Problem —
○
Ochiq
07
1300 → 1500 · 25 min
Inversiyalarni sanash
Inversiyalar nima ekanini va ularni merge sort yordamida O(n log n) da sanashni o‘rganish.
Quiz 0%
Problem —
○
Ochiq
08
1300 → 1500 · 27 min
Quicksort: partition va pivot
Quicksort: partition sxemasi, pivot strategiyasi va O(n²) dan himoyalanish.
Quiz 0%
Problem —
○
Ochiq
09
1300 → 1500 · 28 min
Heap sort
Heap sort: heapify tamoyili va nima uchun kafolatlangan O(n log n) HAM joyida (in-place) ishlashi.
Quiz 0%
Problem —
○
Ochiq
10
1300 → 1500 · 30 min
Nega O(n log n) pastki chegara
Comparison-based saralashning Ω(n log n) pastki chegarasini va bu nimani anglatishini tushunish.
Quiz 0%
Problem —
○
Ochiq
Bosqich 3
0/5
11
1300 → 1500 · 32 min
Barqarorlik (stability)
Barqarorlik (stability) nimani anglatishini va u qachon TO‘G‘RI JAVOB uchun hal qiluvchi ekanini bilish.
Quiz 0%
Problem —
○
Ochiq
12
1300 → 1500 · 33 min
Custom komparatorlar
O‘z tartiblash qoidalarini komparatorlar bilan yozish: lambda, qat’iy zaif tartib qoidasi.
Quiz 0%
Problem —
○
Ochiq
13
1300 → 1500 · 35 min
Ko‘p kalitli tartiblash
Ko‘p kalitli tartiblashni zanjir if bilan va tuple/pair yordamida yozishni o‘rganish.
Quiz 0%
Problem —
○
Ochiq
14
1300 → 1500 · 37 min
STL sorting vositalari
STL ning maxsus saralash vositalarini — partial_sort, nth_element, is_sorted — bilish.
Quiz 0%
Problem —
○
Ochiq
15
1300 → 1500 · 38 min
Sortingni masalalarga qo‘llash
O‘rganilgan barcha saralash naqshlarini real masalalarga qo‘llashni mashq qilish.
Quiz 0%
Problem —
○
Ochiq
Bosqich 4
0/3
16
1300 → 1500 · 40 min
Radix sort
Radix sortni tushunish: sonlarni raqamma-raqam, barqaror counting sort yordamida O(d·n) da tartiblash.
Quiz 0%
Problem —
○
Ochiq
17
1300 → 1500 · 42 min
Koordinatalarni siqish
Koordinatalarni siqish: 10⁹ gacha bo‘lgan qiymatlarni 0..n−1 oralig‘iga o‘tkazib, ularni massiv indeksi sifatida ishlatish.
Quiz 0%
Problem —
○
Ochiq
18
1300 → 1500 · 43 min
Quickselect va nth_element
Quickselect va nth_element: butun massivni tartiblamasdan k-chi eng kichik elementni o‘rtacha O(n) da topish.
Quiz 0%
Problem —
○
Ochiq