<?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=Insertion_sort</id>
	<title>Insertion 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=Insertion_sort"/>
	<link rel="alternate" type="text/html" href="https://ziyosfera.uz/index.php?title=Insertion_sort&amp;action=history"/>
	<updated>2026-11-19T15:33:03Z</updated>
	<subtitle>Ziyosferadagi mazkur sahifaning oʻzgarishlar tarixi</subtitle>
	<generator>MediaWiki 1.45.1</generator>
	<entry>
		<id>https://ziyosfera.uz/index.php?title=Insertion_sort&amp;diff=507327&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=Insertion_sort&amp;diff=507327&amp;oldid=prev"/>
		<updated>2026-08-10T20:34:50Z</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;Insertion sort — (Joylab saralash)&amp;#039;&amp;#039;&amp;#039; ham tartibsiz [[massiv]] elementlarini [[saralash]] uchun moʻljallangan. Uning ishlash algoritmi xuddi qoʻldagi kartani saralashga oʻxshab ketadi. Tartibsiz turgan kartalar ichidan birini olasiz va uni oʻzi turishi kerak boʻlgan joyga joylashtirib qoʻyasiz.&lt;br /&gt;
&lt;br /&gt;
Insertion sort ham shu koʻrinishda ishlaydi. Algoritm oldin massiv boshidagi ikkita elementni saralab olib, massivning qolgan elementlarini shunga qarab oʻz oʻrniga joylashtirib chiqadi&amp;lt;ref&amp;gt;https://www.geeksforgeeks.org/insertion-sort/&amp;lt;/ref&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
[[Fayl:Dark inverted insertion sorting.gif|thumb|Dark inverted insertion sorting]]&lt;br /&gt;
&lt;br /&gt;
== Joylab saralashning xususiyatlari ==&lt;br /&gt;
Bu algoritm oddiy amalga oshirilgani uchun eng oddiy algoritmlardan biridir.&lt;br /&gt;
Insertion sort kichik maʼlumotlarni saralash uchun samarali.&lt;br /&gt;
Joylab saralash tabiatan moslashuvchan, yaʼni qisman saralangan maʼlumotlar toʻplamlari uchun mos keladi.&lt;br /&gt;
&lt;br /&gt;
Insertion sort ham [[Selection sort]] va [[Bubble sort]] kabi O(n&amp;lt;sup&amp;gt;2&amp;lt;/sup&amp;gt;) vaqt murakkabligi bilan ishlasa ham, lekin ulardan koʻra samaraliroq algoritm hisoblanadi. Aynan, massiv elementlari deyarli saralangan holatda Insertion sort algoritmi [[Merge sort]] yoki [[Quick sort]] algoritmidan ham koʻra tezroq ishlaydi&amp;lt;ref&amp;gt;https://medium.com/@algorithmuzb/insertion-sort-joylab-saralash-e83945d9b543&amp;lt;/ref&amp;gt;.&lt;br /&gt;
&lt;br /&gt;
== Joylab saralash algoritmining ishlashi ==&lt;br /&gt;
Misolni koʻrib chiqing: arr[]: {12, 11, 13, 5, 6}&lt;br /&gt;
   12   	   11   	   13   	   5   	   6   &lt;br /&gt;
;Birinchi oʻtish:&lt;br /&gt;
Dastlab, massivning dastlabki ikkita elementi joylash tartibida taqqoslanadi.&lt;br /&gt;
   12   	   11   	   13   	   5   	   6   &lt;br /&gt;
Bu yerda 12 11 dan katta, ular oʻsish tartibida emas va 12 oʻzining toʻgʻri joyida emas. Shunday qilib, 11 va 12 ning oʻrnini almashtiring.&lt;br /&gt;
Shunday qilib, hozircha 11 tartiblangan pastki qatorda saqlanadi.&lt;br /&gt;
   11   	   12   	   13   	   5   	   6   &lt;br /&gt;
;Ikkinchi oʻtish:&lt;br /&gt;
Endi keyingi ikkita elementga oʻting va ularni solishtiring&lt;br /&gt;
   11   	   12   	   13   	   5   	   6   &lt;br /&gt;
Bu yerda 13 12 dan katta, shuning uchun ikkala element ham oʻsish tartibida turibdi, almashtirish sodir boʻlmaydi. 12, shuningdek, 11 bilan birga tartiblangan pastki qatorda saqlanadi&lt;br /&gt;
;Uchinchi oʻtish:&lt;br /&gt;
Endi tartiblangan kichik massivda ikkita element mavjud, ular 11 va 12&lt;br /&gt;
Keyingi ikkita elementga oʻtish: 13 va 5&lt;br /&gt;
   11   	   12   	   13   	   5   	   6   &lt;br /&gt;
5 va 13 ikkalasi ham oʻz joyida emas, shuning uchun ularni almashtiring&lt;br /&gt;
   11   	   12   	   5   	   13   	   6   &lt;br /&gt;
Almashtirilgandan soʻng, 12 va 5 elementlar tartiblanmadi, shuning uchun yana almashtiriladi&lt;br /&gt;
   11   	   5   	   12   	   13   	   6   &lt;br /&gt;
Bu yerda yana 11 va 5 tartiblanmadi, shuning uchun yana almashtiring&lt;br /&gt;
   5   	   11   	   12   	   13   	   6   &lt;br /&gt;
bu yerda u oʻzining toʻgʻri holatida&lt;br /&gt;
;Toʻrtinchi oʻtish:&lt;br /&gt;
Endi tartiblangan kichik massivda mavjud boʻlgan elementlar 5, 11 va 12&lt;br /&gt;
Keyingi ikkita elementga oʻtish: 13 va 6&lt;br /&gt;
   5   	   11   	   12   	   13   	   6   &lt;br /&gt;
Shubhasiz, ular tartiblanmagan, shuning uchun ikkalasini almashtirishni amalga oshiring&lt;br /&gt;
   5   	   11   	   12   	   6   	   13   &lt;br /&gt;
Endi 6 12 dan kichik, shuning uchun yana almashtiring&lt;br /&gt;
   5   	   11   	   6   	   12   	   13   &lt;br /&gt;
Almashtirish 11 va 6 ni tartiblamaydi, shuning uchun yana almashtiring&lt;br /&gt;
   5   	   6   	   11   	   12   	   13   &lt;br /&gt;
Nihoyat, massiv toʻliq tartiblangan.&lt;br /&gt;
&lt;br /&gt;
[[Fayl:InsertionSort.jpg|thumb|InsertionSort]]&lt;br /&gt;
&lt;br /&gt;
== Dasturi ==&lt;br /&gt;
&amp;lt;pre&amp;gt;&lt;br /&gt;
#include &amp;lt;bits/stdc++.h&amp;gt;&lt;br /&gt;
using namespace std;&lt;br /&gt;
void insertionSort(int arr[], int n)&lt;br /&gt;
{&lt;br /&gt;
    int i, key, j;&lt;br /&gt;
    for (i = 1; i &amp;lt; n; i++)&lt;br /&gt;
    {&lt;br /&gt;
        key = arr[i];&lt;br /&gt;
        j = i - 1;&lt;br /&gt;
        while (j &amp;gt;= 0 &amp;amp;&amp;amp; arr[j] &amp;gt; key)&lt;br /&gt;
        {&lt;br /&gt;
            arr[j + 1] = arr[j];&lt;br /&gt;
            j = j - 1;&lt;br /&gt;
        }&lt;br /&gt;
        arr[j + 1] = key;&lt;br /&gt;
    }&lt;br /&gt;
}&lt;br /&gt;
void printArray(int arr[], int n)&lt;br /&gt;
{&lt;br /&gt;
    int i;&lt;br /&gt;
    for (i = 0; i &amp;lt; n; i++)&lt;br /&gt;
        cout &amp;lt;&amp;lt; arr[i] &amp;lt;&amp;lt; &amp;quot; &amp;quot;;&lt;br /&gt;
    cout &amp;lt;&amp;lt; endl;&lt;br /&gt;
}&lt;br /&gt;
int main()&lt;br /&gt;
{&lt;br /&gt;
    int arr[] = { 12, 11, 13, 5, 6 };&lt;br /&gt;
    int N = sizeof(arr) / sizeof(arr[0]);&lt;br /&gt;
    insertionSort(arr, N);&lt;br /&gt;
    printArray(arr, N);&lt;br /&gt;
    return 0;&lt;br /&gt;
}&lt;br /&gt;
&amp;lt;/pre&amp;gt;&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>