<?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=Andoza%3ASorting</id>
	<title>Andoza:Sorting - Oʻzgarishlar tarixi</title>
	<link rel="self" type="application/atom+xml" href="https://ziyosfera.uz/index.php?action=history&amp;feed=atom&amp;title=Andoza%3ASorting"/>
	<link rel="alternate" type="text/html" href="https://ziyosfera.uz/index.php?title=Andoza:Sorting&amp;action=history"/>
	<updated>2026-11-18T11:57:37Z</updated>
	<subtitle>Ziyosferadagi mazkur sahifaning oʻzgarishlar tarixi</subtitle>
	<generator>MediaWiki 1.45.1</generator>
	<entry>
		<id>https://ziyosfera.uz/index.php?title=Andoza:Sorting&amp;diff=1633191&amp;oldid=prev</id>
		<title>Programmer 02:07, 2026-yil 17-noyabr da</title>
		<link rel="alternate" type="text/html" href="https://ziyosfera.uz/index.php?title=Andoza:Sorting&amp;diff=1633191&amp;oldid=prev"/>
		<updated>2026-11-17T02:07:59Z</updated>

		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;Yangi sahifa&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{Navbox&lt;br /&gt;
|name      = Sorting&lt;br /&gt;
|title     = [[Sorting algorithm]]s&lt;br /&gt;
|state     = {{{state|autocollapse}}}&lt;br /&gt;
|image     = &lt;br /&gt;
|listclass = hlist&lt;br /&gt;
&lt;br /&gt;
|group1  = Theory&lt;br /&gt;
|list1   =&lt;br /&gt;
*[[Computational complexity theory]]&lt;br /&gt;
*[[Big O notation]]&lt;br /&gt;
*[[Total order]]&lt;br /&gt;
*[[List (abstract data type)|Lists]]&lt;br /&gt;
*[[In-place algorithm|Inplacement]]&lt;br /&gt;
*[[Sorting algorithm#Stability|Stability]]&lt;br /&gt;
*[[Comparison sort]]&lt;br /&gt;
*[[Adaptive sort]]&lt;br /&gt;
*[[Sorting network]]&lt;br /&gt;
*[[Integer sorting]]&lt;br /&gt;
*[[X + Y sorting]]&lt;br /&gt;
*[[Transdichotomous model]]&lt;br /&gt;
*[[Quantum sort]]&lt;br /&gt;
&lt;br /&gt;
|group2  = Exchange sorts&lt;br /&gt;
|list2   =&lt;br /&gt;
*[[Bubble sort]]&lt;br /&gt;
*[[Cocktail shaker sort]]&lt;br /&gt;
*[[Odd–even sort]]&lt;br /&gt;
*[[Comb sort]]&lt;br /&gt;
*[[Gnome sort]]&lt;br /&gt;
*[[Proportion extend sort]]&lt;br /&gt;
*[[Quicksort]]&lt;br /&gt;
&lt;br /&gt;
|group3  = [[Selection algorithm|Selection sorts]]&lt;br /&gt;
|list3   =&lt;br /&gt;
*[[Selection sort]]&lt;br /&gt;
*[[Heapsort]]&lt;br /&gt;
*[[Smoothsort]]&lt;br /&gt;
*[[Cartesian tree#Application in sorting|Cartesian tree sort]]&lt;br /&gt;
*[[Tournament sort]]&lt;br /&gt;
*[[Cycle sort]]&lt;br /&gt;
*[[Weak heap#Weak-heap sort|Weak-heap sort]]&lt;br /&gt;
&lt;br /&gt;
|group4  = Insertion sorts&lt;br /&gt;
|list4   =&lt;br /&gt;
*[[Insertion sort]]&lt;br /&gt;
*[[Shellsort]]&lt;br /&gt;
*[[Splaysort]]&lt;br /&gt;
*[[Tree sort]]&lt;br /&gt;
*[[Library sort]]&lt;br /&gt;
*[[Patience sorting]]&lt;br /&gt;
&lt;br /&gt;
|group5  = Merge sorts&lt;br /&gt;
|list5   =&lt;br /&gt;
*[[Merge sort]]&lt;br /&gt;
*[[Cascade merge sort]]&lt;br /&gt;
*[[Oscillating merge sort]]&lt;br /&gt;
*[[Polyphase merge sort]]&lt;br /&gt;
&lt;br /&gt;
|group6  = Distribution sorts&lt;br /&gt;
|list6   =&lt;br /&gt;
*[[American flag sort]]&lt;br /&gt;
*[[Bead sort]]&lt;br /&gt;
*[[Bucket sort]]&lt;br /&gt;
*[[Burstsort]]&lt;br /&gt;
*[[Counting sort]]&lt;br /&gt;
*[[Interpolation sort]]&lt;br /&gt;
*[[Pigeonhole sort]]&lt;br /&gt;
*[[Proxmap sort]]&lt;br /&gt;
*[[Radix sort]]&lt;br /&gt;
*[[Flashsort]]&lt;br /&gt;
&lt;br /&gt;
|group7  = [[Concurrency (computer science)|Concurrent]] sorts&lt;br /&gt;
|list7   =&lt;br /&gt;
*[[Bitonic sorter]]&lt;br /&gt;
*[[Batcher odd–even mergesort]]&lt;br /&gt;
*[[Cubesort]]&lt;br /&gt;
*[[Pairwise sorting network]]&lt;br /&gt;
*[[Samplesort]]&lt;br /&gt;
&lt;br /&gt;
|group8  = [[Hybrid algorithm|Hybrid sorts]]&lt;br /&gt;
|list8   =&lt;br /&gt;
*[[Block sort|Block merge sort]]&lt;br /&gt;
*[[Introsort]]&lt;br /&gt;
*[[Kirkpatrick–Reisch sort]]&lt;br /&gt;
*[[Merge-insertion sort]]&lt;br /&gt;
*[[Powersort]]&lt;br /&gt;
*[[Timsort]]&lt;br /&gt;
*[[Spreadsort]]&lt;br /&gt;
&lt;br /&gt;
|group9  = Other&lt;br /&gt;
|list9  =&lt;br /&gt;
*[[Topological sorting]]&lt;br /&gt;
**[[Pre-topological order]]&lt;br /&gt;
*[[Pancake sorting]]&lt;br /&gt;
*[[Spaghetti sort]]&lt;br /&gt;
&lt;br /&gt;
|group10  = Impractical sorts&lt;br /&gt;
|list10  =&lt;br /&gt;
*[[Stooge sort]]&lt;br /&gt;
*[[Slowsort]]&lt;br /&gt;
*[[Bogosort]]&lt;br /&gt;
&lt;br /&gt;
|below = {{Category-inline|Sorting algorithms|Category}}&lt;br /&gt;
}}&amp;lt;noinclude&amp;gt;&lt;br /&gt;
{{collapsible option}}&lt;br /&gt;
&lt;br /&gt;
[[Category:Computer science navigational boxes]]&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/noinclude&amp;gt;&lt;/div&gt;</summary>
		<author><name>Programmer</name></author>
	</entry>
</feed>