Template talk:Sorting

__DTSUBSCRIBEBUTTONDESKTOP__{"headingLevel":2,"name":"h-82.130.79.176-2008-07-07T09:19:00.000Z","type":"heading","level":0,"id":"h-Sorting_Network_Picture-2008-07-07T09:19:00.000Z","replies":["c-82.130.79.176-2008-07-07T09:19:00.000Z-Sorting_Network_Picture"],"text":"Sorting Network Picture","linkableTitle":"Sorting Network Picture"}-->

Sorting Network Picture

__DTELLIPSISBUTTON__{"threadItem":{"headingLevel":2,"name":"h-82.130.79.176-2008-07-07T09:19:00.000Z","type":"heading","level":0,"id":"h-Sorting_Network_Picture-2008-07-07T09:19:00.000Z","replies":["c-82.130.79.176-2008-07-07T09:19:00.000Z-Sorting_Network_Picture"]}}-->
__DTSUBSCRIBEBUTTONMOBILE__{"headingLevel":2,"name":"h-82.130.79.176-2008-07-07T09:19:00.000Z","type":"heading","level":0,"id":"h-Sorting_Network_Picture-2008-07-07T09:19:00.000Z","replies":["c-82.130.79.176-2008-07-07T09:19:00.000Z-Sorting_Network_Picture"],"text":"Sorting Network Picture","linkableTitle":"Sorting Network Picture"}-->

Why is th esorting network picture the same on all sorting sites? This does not make sense, as I actually thought it would depict the curretn sorting algorithm. I think it should be removed from the template. 82.130.79.176 (talk) 09:19, 7 July 2008 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2008-07-07T09:19:00.000Z","author":"82.130.79.176","type":"comment","level":1,"id":"c-82.130.79.176-2008-07-07T09:19:00.000Z-Sorting_Network_Picture","replies":[]}}-->

__DTSUBSCRIBEBUTTONDESKTOP__{"headingLevel":2,"name":"h-128.61.125.129-2008-12-03T19:41:00.000Z","type":"heading","level":0,"id":"h-Jokeful?-2008-12-03T19:41:00.000Z","replies":["c-128.61.125.129-2008-12-03T19:41:00.000Z-Jokeful?"],"text":"Jokeful?","linkableTitle":"Jokeful?"}-->

Jokeful?

__DTELLIPSISBUTTON__{"threadItem":{"headingLevel":2,"name":"h-128.61.125.129-2008-12-03T19:41:00.000Z","type":"heading","level":0,"id":"h-Jokeful?-2008-12-03T19:41:00.000Z","replies":["c-128.61.125.129-2008-12-03T19:41:00.000Z-Jokeful?"]}}-->
__DTSUBSCRIBEBUTTONMOBILE__{"headingLevel":2,"name":"h-128.61.125.129-2008-12-03T19:41:00.000Z","type":"heading","level":0,"id":"h-Jokeful?-2008-12-03T19:41:00.000Z","replies":["c-128.61.125.129-2008-12-03T19:41:00.000Z-Jokeful?"],"text":"Jokeful?","linkableTitle":"Jokeful?"}-->

Jokeful is not a real word. 128.61.125.129 (talk) 19:41, 3 December 2008 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2008-12-03T19:41:00.000Z","author":"128.61.125.129","type":"comment","level":1,"id":"c-128.61.125.129-2008-12-03T19:41:00.000Z-Jokeful?","replies":[]}}-->

__DTSUBSCRIBEBUTTONDESKTOP__{"headingLevel":2,"name":"h-Matttoothman-2012-05-07T16:53:00.000Z","type":"heading","level":0,"id":"h-Bogosort-2012-05-07T16:53:00.000Z","replies":["c-Matttoothman-2012-05-07T16:53:00.000Z-Bogosort"],"text":"Bogosort","linkableTitle":"Bogosort"}-->

Bogosort

__DTELLIPSISBUTTON__{"threadItem":{"headingLevel":2,"name":"h-Matttoothman-2012-05-07T16:53:00.000Z","type":"heading","level":0,"id":"h-Bogosort-2012-05-07T16:53:00.000Z","replies":["c-Matttoothman-2012-05-07T16:53:00.000Z-Bogosort"]}}-->
__DTSUBSCRIBEBUTTONMOBILE__{"headingLevel":2,"name":"h-Matttoothman-2012-05-07T16:53:00.000Z","type":"heading","level":0,"id":"h-Bogosort-2012-05-07T16:53:00.000Z","replies":["c-Matttoothman-2012-05-07T16:53:00.000Z-Bogosort"],"text":"Bogosort","linkableTitle":"Bogosort"}-->

Any reason why it's listed twice (under 'other' and 'exchange sorts')? Matttoothman (talk) 16:53, 7 May 2012 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2012-05-07T16:53:00.000Z","author":"Matttoothman","type":"comment","level":1,"id":"c-Matttoothman-2012-05-07T16:53:00.000Z-Bogosort","replies":["c-David_Eppstein-2012-05-07T17:51:00.000Z-Matttoothman-2012-05-07T16:53:00.000Z"]}}-->

Looks like a mistake to me. Whether it's an exchange sort depends on how you do the random permutation part, but that's a reasonable enough place to leave it. —David Eppstein (talk) 17:51, 7 May 2012 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2012-05-07T17:51:00.000Z","author":"David Eppstein","type":"comment","level":2,"id":"c-David_Eppstein-2012-05-07T17:51:00.000Z-Matttoothman-2012-05-07T16:53:00.000Z","replies":[]}}-->
__DTSUBSCRIBEBUTTONDESKTOP__{"headingLevel":2,"name":"h-31.205.10.23-2015-04-29T21:46:00.000Z","type":"heading","level":0,"id":"h-Create_category_page?-2015-04-29T21:46:00.000Z","replies":["c-31.205.10.23-2015-04-29T21:46:00.000Z-Create_category_page?"],"text":"Create category page?","linkableTitle":"Create category page?"}-->

Create category page?

__DTELLIPSISBUTTON__{"threadItem":{"headingLevel":2,"name":"h-31.205.10.23-2015-04-29T21:46:00.000Z","type":"heading","level":0,"id":"h-Create_category_page?-2015-04-29T21:46:00.000Z","replies":["c-31.205.10.23-2015-04-29T21:46:00.000Z-Create_category_page?"]}}-->
__DTSUBSCRIBEBUTTONMOBILE__{"headingLevel":2,"name":"h-31.205.10.23-2015-04-29T21:46:00.000Z","type":"heading","level":0,"id":"h-Create_category_page?-2015-04-29T21:46:00.000Z","replies":["c-31.205.10.23-2015-04-29T21:46:00.000Z-Create_category_page?"],"text":"Create category page?","linkableTitle":"Create category page?"}-->

While search algorithms have a category page , sorting algorithms have a template listing all entries. Maybe a category page for this template, or a template for all searching algorithms should be made... — Preceding unsigned comment added by 31.205.10.23 (talk) 21:46, 29 April 2015 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2015-04-29T21:46:00.000Z","author":"31.205.10.23","type":"comment","level":1,"id":"c-31.205.10.23-2015-04-29T21:46:00.000Z-Create_category_page?","replies":[]}}-->

__DTSUBSCRIBEBUTTONDESKTOP__{"headingLevel":2,"name":"h-Wilhelmtell-2016-04-06T21:05:00.000Z","type":"heading","level":0,"id":"h-Aren't_Heap_Sort_and_Smooth_Sort_of_the_Exchange_category?-2016-04-06T21:05:00.000Z","replies":["c-Wilhelmtell-2016-04-06T21:05:00.000Z-Aren't_Heap_Sort_and_Smooth_Sort_of_the_Exchange_category?"],"text":"Aren't Heap Sort and Smooth Sort of the Exchange category?","linkableTitle":"Aren't Heap Sort and Smooth Sort of the Exchange category?"}-->

Aren't Heap Sort and Smooth Sort of the Exchange category?

__DTELLIPSISBUTTON__{"threadItem":{"headingLevel":2,"name":"h-Wilhelmtell-2016-04-06T21:05:00.000Z","type":"heading","level":0,"id":"h-Aren't_Heap_Sort_and_Smooth_Sort_of_the_Exchange_category?-2016-04-06T21:05:00.000Z","replies":["c-Wilhelmtell-2016-04-06T21:05:00.000Z-Aren't_Heap_Sort_and_Smooth_Sort_of_the_Exchange_category?"]}}-->
__DTSUBSCRIBEBUTTONMOBILE__{"headingLevel":2,"name":"h-Wilhelmtell-2016-04-06T21:05:00.000Z","type":"heading","level":0,"id":"h-Aren't_Heap_Sort_and_Smooth_Sort_of_the_Exchange_category?-2016-04-06T21:05:00.000Z","replies":["c-Wilhelmtell-2016-04-06T21:05:00.000Z-Aren't_Heap_Sort_and_Smooth_Sort_of_the_Exchange_category?"],"text":"Aren't Heap Sort and Smooth Sort of the Exchange category?","linkableTitle":"Aren't Heap Sort and Smooth Sort of the Exchange category?"}-->

According to the paper by Dijkstra[1], smoothsort is of the exchange category. Right now I see smoothsort and heap sort in the selection category.

Wilhelmtell (talk) 21:05, 6 April 2016 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2016-04-06T21:05:00.000Z","author":"Wilhelmtell","type":"comment","level":1,"id":"c-Wilhelmtell-2016-04-06T21:05:00.000Z-Aren't_Heap_Sort_and_Smooth_Sort_of_the_Exchange_category?","replies":[]}}-->

__DTSUBSCRIBEBUTTONDESKTOP__{"headingLevel":2,"name":"h-184.146.224.196-2021-05-09T12:47:00.000Z","type":"heading","level":0,"id":"h-Add_CAM_to_'other'_entry?-2021-05-09T12:47:00.000Z","replies":["c-184.146.224.196-2021-05-09T12:47:00.000Z-Add_CAM_to_'other'_entry?"],"text":"Add CAM to 'other' entry?","linkableTitle":"Add CAM to 'other' entry?"}-->

Add CAM to 'other' entry?

__DTELLIPSISBUTTON__{"threadItem":{"headingLevel":2,"name":"h-184.146.224.196-2021-05-09T12:47:00.000Z","type":"heading","level":0,"id":"h-Add_CAM_to_'other'_entry?-2021-05-09T12:47:00.000Z","replies":["c-184.146.224.196-2021-05-09T12:47:00.000Z-Add_CAM_to_'other'_entry?"]}}-->
__DTSUBSCRIBEBUTTONMOBILE__{"headingLevel":2,"name":"h-184.146.224.196-2021-05-09T12:47:00.000Z","type":"heading","level":0,"id":"h-Add_CAM_to_'other'_entry?-2021-05-09T12:47:00.000Z","replies":["c-184.146.224.196-2021-05-09T12:47:00.000Z-Add_CAM_to_'other'_entry?"],"text":"Add CAM to 'other' entry?","linkableTitle":"Add CAM to 'other' entry?"}-->

Content-addressable memory is an alternative to sorting as are the analogue computing examples in the other section. 184.146.224.196 (talk) 12:47, 9 May 2021 (UTC)[reply]__DTELLIPSISBUTTON__{"threadItem":{"timestamp":"2021-05-09T12:47:00.000Z","author":"184.146.224.196","type":"comment","level":1,"id":"c-184.146.224.196-2021-05-09T12:47:00.000Z-Add_CAM_to_'other'_entry?","replies":[]}}-->