<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="uz">
	<id>https://ziyosfera.uz/index.php?action=history&amp;feed=atom&amp;title=Merge_Sort</id>
	<title>Merge Sort - Oʻzgarishlar tarixi</title>
	<link rel="self" type="application/atom+xml" href="https://ziyosfera.uz/index.php?action=history&amp;feed=atom&amp;title=Merge_Sort"/>
	<link rel="alternate" type="text/html" href="https://ziyosfera.uz/index.php?title=Merge_Sort&amp;action=history"/>
	<updated>2026-11-19T15:27:36Z</updated>
	<subtitle>Ziyosferadagi mazkur sahifaning oʻzgarishlar tarixi</subtitle>
	<generator>MediaWiki 1.45.1</generator>
	<entry>
		<id>https://ziyosfera.uz/index.php?title=Merge_Sort&amp;diff=609393&amp;oldid=prev</id>
		<title>Programmer: Oʻzbekcha Vikipediyadan (UzWiki) 100% asl holatida import qilindi.</title>
		<link rel="alternate" type="text/html" href="https://ziyosfera.uz/index.php?title=Merge_Sort&amp;diff=609393&amp;oldid=prev"/>
		<updated>2026-08-10T23:37:17Z</updated>

		<summary type="html">&lt;p&gt;Oʻzbekcha Vikipediyadan (UzWiki) 100% asl holatida import qilindi.&lt;/p&gt;
&lt;p&gt;&lt;b&gt;Yangi sahifa&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&amp;#039;&amp;#039;&amp;#039;Merge sort — (Birlashtirib saralash)&amp;#039;&amp;#039;&amp;#039; algoritmi asosiy beshta saralash algoritmlari ([[Bubble sort]], [[Quick sort]] va boshqalar) dan biri boʻlib, chiziqli saralash algoritmlaridan farqli ravishda „boʻlib tashla va hukmronlik qil“ tipidagi algoritm hisoblanadi. Bu turdagi algoritmlar katta hajmdagi masalalarni nisbatan kichik boʻlgan va oson yechiladigan qismlarga ajratgan holda bajaradi. Bunday algoritmlar masalalarni yechishda vaqtdan yutish imkonini beradi&amp;lt;ref&amp;gt;https://www.texnoman.uz/post/birlashmali-saralash-merge-sort.html&amp;lt;/ref&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
[[Fayl:Merge-sort-example-300px.gif|thumb|Merge-sort-example-300px]]&lt;br /&gt;
&lt;br /&gt;
== Merge sort algoritmi ==&lt;br /&gt;
* Merge Sort funksiyasiga [[massiv]] va uning boshlangʻich (eng chapdagi element) va oxirgi nuqtalari (eng oʻngdagi element) beriladi.&lt;br /&gt;
* Massivning oʻrtasi hisoblanadi: oʻrtasi = (chap + oʻng)/2. Bu narsa uni teng ikkiga boʻlish uchun kerak boʻladi.&lt;br /&gt;
* Merge sortni rekursiv holda birinchi va ikkinchi qismlar uchun chaqiriladi.&lt;br /&gt;
* 2- va 3-qismlarda hosil boʻlgan massivlar birlashtirib chiqiladi.&lt;br /&gt;
Algoritm ishlash tezligi O(n*log(n)) boʻlib tezligi O(n&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;) boʻlgan oddiy [[Bubble sort]], [[Insertion sort]], [[Selection sort]]lardan ancha tez ishlaydi. Taqqoslash asosida ishlaydigan algortmlarning eng tez ishlash holati O(n*log(n)) boʻlishi isbotlangan&amp;lt;ref&amp;gt;https://medium.com/@algorithmuzb/merge-sort-birlashtirib-saralash-a870fae60e1e&amp;lt;/ref&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
[[Fayl:Merge sort algorithm diagram.svg|thumb|Merge sort algorithm diagram]]&lt;br /&gt;
&lt;br /&gt;
== Dasturi ==&lt;br /&gt;
&amp;lt;pre&amp;gt;#include &amp;lt;iostream&amp;gt;&lt;br /&gt;
using namespace std;&lt;br /&gt;
&lt;br /&gt;
void merge(int array[], int const left, int const mid, int const right)&lt;br /&gt;
{&lt;br /&gt;
    auto const subArrayOne = mid - left + 1;&lt;br /&gt;
    auto const subArrayTwo = right - mid;&lt;br /&gt;
&lt;br /&gt;
    auto *leftArray = new int[subArrayOne],&lt;br /&gt;
         *rightArray = new int[subArrayTwo];&lt;br /&gt;
&lt;br /&gt;
    for (auto i = 0; i &amp;lt; subArrayOne; i++)&lt;br /&gt;
        leftArray[i] = array[left + i];&lt;br /&gt;
    for (auto j = 0; j &amp;lt; subArrayTwo; j++)&lt;br /&gt;
        rightArray[j] = array[mid + 1 + j];&lt;br /&gt;
 &lt;br /&gt;
    auto indexOfSubArrayOne = 0,&lt;br /&gt;
        indexOfSubArrayTwo = 0;&lt;br /&gt;
    int indexOfMergedArray = left;&lt;br /&gt;
    while (indexOfSubArrayOne &amp;lt; subArrayOne &amp;amp;&amp;amp; indexOfSubArrayTwo &amp;lt; subArrayTwo) {&lt;br /&gt;
        if (leftArray[indexOfSubArrayOne] &amp;lt;= rightArray[indexOfSubArrayTwo]) {&lt;br /&gt;
            array[indexOfMergedArray] = leftArray[indexOfSubArrayOne];&lt;br /&gt;
            indexOfSubArrayOne++;&lt;br /&gt;
        }&lt;br /&gt;
        else {&lt;br /&gt;
            array[indexOfMergedArray] = rightArray[indexOfSubArrayTwo];&lt;br /&gt;
            indexOfSubArrayTwo++;&lt;br /&gt;
        }&lt;br /&gt;
        indexOfMergedArray++;&lt;br /&gt;
    }&lt;br /&gt;
    while (indexOfSubArrayOne &amp;lt; subArrayOne) {&lt;br /&gt;
        array[indexOfMergedArray] = leftArray[indexOfSubArrayOne];&lt;br /&gt;
        indexOfSubArrayOne++;&lt;br /&gt;
        indexOfMergedArray++;&lt;br /&gt;
    }&lt;br /&gt;
    while (indexOfSubArrayTwo &amp;lt; subArrayTwo) {&lt;br /&gt;
        array[indexOfMergedArray] = rightArray[indexOfSubArrayTwo];&lt;br /&gt;
        indexOfSubArrayTwo++;&lt;br /&gt;
        indexOfMergedArray++;&lt;br /&gt;
    }&lt;br /&gt;
}&lt;br /&gt;
void mergeSort(int array[], int const begin, int const end)&lt;br /&gt;
{&lt;br /&gt;
    if (begin &amp;gt;= end)&lt;br /&gt;
        return; // Returns recursively&lt;br /&gt;
    auto mid = begin + (end - begin) / 2;&lt;br /&gt;
    mergeSort(array, begin, mid);&lt;br /&gt;
    mergeSort(array, mid + 1, end);&lt;br /&gt;
    merge(array, begin, mid, end);&lt;br /&gt;
}&lt;br /&gt;
void printArray(int A[], int size)&lt;br /&gt;
{&lt;br /&gt;
    for (auto i = 0; i &amp;lt; size; i++)&lt;br /&gt;
        cout &amp;lt;&amp;lt; A[i] &amp;lt;&amp;lt; &amp;quot; &amp;quot;;&lt;br /&gt;
}&lt;br /&gt;
int main()&lt;br /&gt;
{&lt;br /&gt;
    int arr[] = { 12, 11, 13, 5, 6, 7 };&lt;br /&gt;
    auto arr_size = sizeof(arr) / sizeof(arr[0]);&lt;br /&gt;
    cout &amp;lt;&amp;lt; &amp;quot;Given array is \n&amp;quot;;&lt;br /&gt;
    printArray(arr, arr_size);&lt;br /&gt;
    mergeSort(arr, 0, arr_size - 1);&lt;br /&gt;
    cout &amp;lt;&amp;lt; &amp;quot;\nSorted array is \n&amp;quot;;&lt;br /&gt;
    printArray(arr, arr_size);&lt;br /&gt;
    return 0;&lt;br /&gt;
}&amp;lt;/pre&amp;gt;&amp;lt;ref&amp;gt;https://www.geeksforgeeks.org/merge-sort/&amp;lt;/ref&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
== Kamchiligi ==&lt;br /&gt;
* Kichikroq vazifalar uchun boshqa tartiblash algoritmlariga nisbatan sekinroq.&lt;br /&gt;
* Merge sort algoritmi vaqtinchalik massiv uchun 0(n) qoʻshimcha xotira maydonini talab qiladi.&lt;br /&gt;
* Agar massiv tartiblangan boʻlsa ham, u butun jarayondan oʻtadi.&lt;br /&gt;
== Manbalar ==&lt;br /&gt;
&lt;br /&gt;
 {{Turkumsiz|date=Aprel 2024}}&lt;/div&gt;</summary>
		<author><name>Programmer</name></author>
	</entry>
</feed>