Selection algorithm: Revision history

Article
Talk

View logs for this page (view filter log)

Filter revisionsshowhide

To date:

Tag filter:

Invert selection

External tools:

For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

curprev 16:1216:12, 26 April 2017 2a00:79e0:d:207:e459:a6ff:470e:2439 talk 23,347 bytes −5 →Partition-based selection: correction: median-of-medians is O(n), which was confusing in the original text and also caused my previous edit to be misleading undo
curprev 16:0316:03, 26 April 2017 2a00:79e0:d:207:e459:a6ff:470e:2439 talk 23,352 bytes +8 →Partition-based selection: clarify that quickselect is average O(n), not worst-case undo
curprev 15:4715:47, 26 April 2017 2a00:79e0:d:207:e459:a6ff:470e:2439 talk 23,344 bytes −750 →Selection by sorting: Remove apparently non-sense text. There isn't any O(n + k log k) worst-case algorithm for partial sorting, and this text is claiming that isn't even as efficient as "simply selecting".. undo

curprev 09:5509:55, 21 February 2017 Diego.stamigni talk contribs 24,094 bytes −518 →Language support: C++ nth_element has been mentioned twice. undo

curprev 18:5218:52, 16 December 2016 174.1.44.2 talk 24,612 bytes +9 No edit summary undo

curprev 15:2515:25, 25 July 2016 Bender235 talk contribs m 24,603 bytes +1 →Language support: clean up; http->https (see this RfC) using AWB undo

curprev 18:3818:38, 29 May 2016 24.61.12.141 talk 24,602 bytes +1 →Online selection algorithm undo

curprev 10:2810:28, 3 April 2016 162.210.130.3 talk 24,601 bytes −12 heapq nsmallest and nlargest have same complexity but the article had wrongly stated them to be different without citation to any source. undo

curprev 19:0719:07, 17 March 2016 129.42.161.36 talk 24,613 bytes +7 →Selection by sorting undo

curprev 06:4306:43, 10 March 2016 Marek69 talk contribs 24,606 bytes +26 clean up and general fixes, http: --> https:, typo(s) fixed: Indeed → Indeed, using AWB undo

curprev 15:3415:34, 29 November 2015 106.216.143.105 talk 24,580 bytes −4 →Unordered partial sorting undo
curprev 15:3315:33, 29 November 2015 106.216.143.105 talk 24,584 bytes +4 →Unordered partial sorting undo

curprev 02:0902:09, 9 October 2015 73.223.74.114 talk 24,580 bytes +11 →Language support undo

curprev 07:5007:50, 4 September 2015 Dexbot talk contribs m 24,569 bytes +204 Bot: Deprecating Template:Cite doi and some minor fixes undo

curprev 18:5318:53, 28 August 2015 Dexbot talk contribs m 24,365 bytes +828 Bot: Deprecating Template:Cite doi and some minor fixes undo

curprev 21:1521:15, 23 June 2015 Parlance talk contribs m 23,537 bytes +17 No edit summary undo

curprev 06:2306:23, 18 December 2014 69.181.196.207 talk 23,520 bytes −3 →Selection by sorting: change sentence structure undo

curprev 20:5020:50, 8 October 2014 76.2.191.92 talk 23,523 bytes +2 →Median selection as pivot strategy undo

curprev 03:2703:27, 20 August 2014 Chmarkine talk contribs m 23,521 bytes +1 →Language support: change to https if the server sends HSTS header, replaced: http://docs.python.org → https://docs.python.org using AWB undo

curprev 07:5007:50, 20 May 2014 Qwertyus talk contribs 23,520 bytes +123 →Language support: C++'s partial_sort is a partial sorting algo; nth_element is the selection algo undo

curprev 20:4420:44, 17 May 2014 Ken7ken talk contribs m 23,397 bytes +1 formatting according other parts of the article undo
curprev 20:4220:42, 17 May 2014 Ken7ken talk contribs m 23,396 bytes +48 Added time complexity for the described algorithm. Also corrected bad use of complexity notation( O(n) is the standard, not "n" ). Quicksort and Quicksearch are names of algorhtms, should start with capital. undo

curprev 05:3505:35, 13 May 2014 72.48.250.196 talk 23,348 bytes −5 →Selection by sorting undo
curprev 05:3405:34, 13 May 2014 72.48.250.196 talk 23,353 bytes +5 →Selection by sorting undo

curprev 18:3118:31, 21 April 2014 Oreo masta talk contribs m 23,348 bytes −8 →Unordered partial sorting: "in fact" was in the sentence twice undo

curprev 16:1216:12, 6 April 2014 AnomieBOT talk contribs m 23,356 bytes +16 Dating maintenance tags: {{Citation needed}} undo
curprev 14:1214:12, 6 April 2014 94.194.248.195 talk 23,340 bytes +19 Added citation needed for lazy languages undo

curprev 11:4011:40, 21 January 2014 Alb d91 talk contribs 23,321 bytes +4 →Lower bounds undo

curprev 00:0800:08, 6 November 2013 98.207.61.170 talk 23,317 bytes −3 No edit summary undo

curprev 15:1415:14, 20 September 2013 2620:0:1019:2:8a51:fbff:fe5c:35e7 talk 23,320 bytes +1 Correct pluralization. undo

curprev 21:2421:24, 16 September 2013 Two Bananas talk contribs 23,319 bytes +3 Updated links from CPAN to MetaCPAN undo

curprev 13:3813:38, 1 September 2013 Nbarth talk contribs 23,316 bytes −110 →External links: other link moved to Median of medians undo
curprev 13:3613:36, 1 September 2013 Nbarth talk contribs 23,426 bytes +128 →External links: more links undo
curprev 13:3213:32, 1 September 2013 Nbarth talk contribs 23,298 bytes +37 →References: Floyd–Rivest 1975 undo

curprev 14:5314:53, 26 August 2013 Nbarth talk contribs m 23,261 bytes −67 →References: cite doi undo
curprev 14:1614:16, 26 August 2013 Nbarth talk contribs 23,328 bytes +280 →Language support: Range queries undo
curprev 13:2413:24, 26 August 2013 Nbarth talk contribs m 23,048 bytes −178 →References: cite doi undo

Retrieved from "https://en.wikipedia.org/wiki/Selection_algorithm"