https://www.vigyanwiki.in/index.php?action=history&feed=atom&title=Template%3ASorting 2026-05-01T21:01:44Z Revision history for this page on the wiki MediaWiki 1.39.3 https://www.vigyanwiki.in/index.php?title=Template:Sorting&diff=133131&oldid=prev 2023-04-14T18:43:52Z

<p>1 revision imported from <a href="https://alpha.indicwiki.in/index.php?title=Template:Sorting" class="extiw" title="alpha:Template:Sorting">alpha:Template:Sorting</a></p> <table style="background-color: #fff; color: #202122;" data-mw="interface"> <tr class="diff-title" lang="en-GB"> <td colspan="1" style="background-color: #fff; color: #202122; text-align: center;">← Older revision</td> <td colspan="1" style="background-color: #fff; color: #202122; text-align: center;">Revision as of 00:13, 15 April 2023</td> </tr><tr><td colspan="2" class="diff-notice" lang="en-GB"><div class="mw-diff-empty">(No difference)</div> </td></tr></table>

Indicwiki https://www.vigyanwiki.in/index.php?title=Template:Sorting&diff=133130&oldid=prev 2023-02-08T05:59:02Z

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

alpha>Indicwiki