C++ TILIDA MA'LUMOTLARNI SARALASHNING TURLI USULLARINI JORIY QILISH VA TAQQOSLASH

Аннотация

This article explores various sorting algorithms in C++, their working principles, and efficiency. The study covers Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort, and the built-in sort() function from the Standard Template Library (STL). Each algorithm is analyzed based on time complexity (Big-O analysis), memory usage, and practical applications. Additionally, their performance is evaluated for small and large datasets. Kalit so‘zlar: C++ saralash, saralash algoritmlari, Pufakcha saralash, Tanlab saralash, Qo‘yish usuli bilan saralash, Birlashtirish usuli bilan saralash, Tezkor 28 THEORETICAL ASPECTS IN THE FORMATION OF PEDAGOGICAL SCIENCES International scientific-online conference saralash, STL sort() funksiyasi, algoritm murakkabligi, vaqt murakkabligi, samaradorlik, ma'lumot tuzilmalari, hisoblash unumdorligi. Ключевые слова: C++ сортировка, алгоритмы сортировки, пузырьковая сортировка, сортировка выбором, сортировка вставками, сортировка слиянием, быстрая сортировка, STL sort(), сложность алгоритма, временная сложность, эффективность, структуры данных, вычислительная производительность. Keywords: C++ sorting, sorting algorithms, Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort, STL sort(), algorithm complexity, time complexity, efficiency, data structures, computational performance. Saralash algoritmlari kompyuter fanining muhim yo‘nalishlaridan biri bo‘lib, ma’lumotlarni tartibga solish va qidiruv jarayonlarini optimallashtirishda muhim rol o‘ynaydi. C++ dasturlash tilida turli saralash algoritmlarini joriy qilish va ularni taqqoslash orqali eng samarali usulni tanlash mumkin. Saralash algoritmlari turli mezonlar bo‘yicha baholanadi. Vaqt murakkabligi (O(n²), O(n log n) va h.k.), xotira murakkabligi (Qo‘shimcha xotira talab qilinishi yoki in-place saralash), eng yaxshi, o‘rtacha va eng yomon holatlardagi ishlash samaradorligi kabi. Ushbu maqolada C++ tilida saralash algoritmlarining dasturiy ifodasi va ularning samaradorlik jihatlari tahlil qilinadi. C++ tilida saralash usullari. Bubble Sort (Pufakcha saralash) - eng oddiy saralash usullaridan biri bo‘lib, har bir juft elementlarni taqqoslab, ularni tartibga keltiradi. Vaqt murakkabligi - Eng yomon holat: O(n²) - agar massiv teskari tartibda bo‘lsa, hamma elementlar almashtiriladi. Eng yaxshi holat: O(n) - agar massiv allaqachon saralangan bo‘lsa, almashtirildi bayrog‘i tufayli faqat bitta sikl bajariladi. #include #include using namespace std; void bubbleSort(std::vector & arr) { int n = arr.size(); bool almashtirildi; for (int i = 0; i arr[j + 1]) { 29 THEORETICAL ASPECTS IN THE FORMATION OF PEDAGOGICAL SCIENCES International scientific-online conference swap(arr[j], arr[j + 1]); almashtirildi = true; } } if (!almashtirildi) break; } } Selection sort (tanlab saralash) - Selection Sort har safar eng kichik elementni topib, uni massiv boshiga joylashtirish orqali ishlaydi. Vaqt murakkabligi: Eng yomon holat: O(n²). O‘rtacha holatda: O(n²). Eng yaxshi holat: O(n²). Bu saralash usuli Bubble Sort bilan bir xil vaqt murakkabligiga ega, lekin almashtirishlar soni kamroq bo‘lgani uchun ko‘proq optimal. void selectionSort(std::vector & arr) { int n = arr.size(); for (int i = 0; i & arr) { int n = arr.size(); for (int i = 1; i = 0 && arr[j] > key) { arr[j + 1] = arr[j]; j--; 30 THEORETICAL ASPECTS IN THE FORMATION OF PEDAGOGICAL SCIENCES International scientific-online conference } arr[j + 1] = key; } } Merge Sort (Bo‘lish va qo‘shish usuli) - Merge Sort rekursiv yondashuv asosida massivni ikkiga bo‘lib, keyin saralab birlashtiradi. Vaqt murakkabligi: Eng yomon holat: O(n log n). Eng yaxshi holat: O(n log n) void merge(std::vector & arr, int left, int mid, int right) { int i = left, j = mid + 1, k = 0; std::vector temp(right - left + 1); while (i & arr, int left, int right) { if (left < right) { int mid = left + (right - left) / 2; mergeSort(arr, left, mid); mergeSort(arr, mid + 1, right); merge(arr, left, mid, right); } } STL sort() funksiyasi - C++ STL ku