Related changes

19 May 2025

• diffhist Algorithm 01:34 +112 David Eppstein talk contribs (→By design paradigm: improve sourcing for divide & conquer / prune & search)
• diffhist Algorithm 01:25 −35 David Eppstein talk contribs (→Ancient algorithms: the citation is right there in the next sentence)
• diffhist Algorithm 01:21 −177 David Eppstein talk contribs (more precisely locate the quotation from stone; page 8 (end of section), not page 4 (earlier version of similar def))
• diffhist Algorithm 01:12 +1,415 David Eppstein talk contribs (→Etymology: clean up attestations and sourcing)
• diffhist m Python (programming language) 00:46 −3 GSK talk contribs (Reverted 1 edit by SigmaSigmaBoy72 (talk) to last revision by Fbergo) Tags: Twinkle Undo
• diffhist m Python (programming language) 00:41 +3 SigmaSigmaBoy72 talk contribs Tag: Reverted
• diffhist Algorithm 00:39 −28 David Eppstein talk contribs (I don't think this essay-like cleanup banner is valid)
• diffhist Hash table 00:37 +67 Hddqsb talk contribs (Add HTML comment about location in Farach-Colton for search complexity (most of the paper is about probe length, but search is different due to negative queries). And note that the paper also has an approach with O(log (1-α)^-1) worst-case expected probe length and insertion time (Theorem 1), but the search time for that approach doesn't appear to be specified.)

18 May 2025

• diffhist Big O notation 22:59 +865 Mike Schwartz talk contribs (→2nd paragraph of this article: Add an {{efn}} template instance, to explain the meaning (in Computational complexity theory) of the terms "space" and "time", and to mention the consequences of the use of "Big O notation". →References and notes: add a sub-section, called "=== Notes ===", containing -- ONLY -- the template instance "{{Notelist}}". This is [needed] because of the addition of an {{efn}} tag in the text of (the second paragraph of the 'lede' section of) this article.)
• diffhist .NET 17:53 0 Counterdoom talk contribs (.NET 9 Latest Update fixed)
• diffhist m Wikipedia:Manual of Style/Words to watch 02:41 +3 Bjenks talk contribs (→Survived by: Typo)

17 May 2025

• diffhist Module:Side box/styles.css 17:06 +84 Andrybak talk contribs (Override font-size for embedded side boxes. Non-embedded Template:Side box gets `font-size: 88%;` from Module:Side box/styles.css#L-6; an embedded Template:Side box (usually through the module) gets the same 88% plus another 88% from class .infobox at MediaWiki:Common.css (to be migrated to Module:Infobox/styles.css). 0.88*0.88=0.7744, which is less than 85% from the guideline MOS:FONTSIZE. See also Special:Diff/1290232777)
• diffhist Android (operating system) 13:07 −14 Depotadore talk contribs (removed One UI because its only on samsung phones and android isn't only samsung phones)
• diffhist Hash table 10:41 +111 Hddqsb talk contribs (Undid revision Special:Diff/1243265270 by Shhhnotsoloud. The bounds in that paper are for the worst-case expected complexity, NOT the worst-case complexity. Still worth mentioning but as a footnote. Also, not sure where log^2 n came from, it's not in the paper.)
• diffhist Data structure 09:40 −18 Hddqsb talk contribs (Undid revision 1243265270 by Shhhnotsoloud (talk). "Blockchain" is not directly related and should not get such a prominent mention; the old disambiguation page was useful.) Tags: Undo Disambiguation links added

16 May 2025

• diffhist Big O notation 22:18 −98 Sbb talk contribs (→Matters of notation: rmv gratuitous 'hairsp;' in inline {{math}}s; consistent {{math}}/{{mvar}} for inline maths; {{em}} for emphasis text; {{blockquote}} instead of colon-indent manual formatting) Tag: 2017 wikitext editor
• diffhist Module:Footnotes/whitelist 22:05 +49 Redrose64 talk contribs (add another entry for CITEREFLohrThielmann1988)
• diffhist Big O notation 21:47 +56 Sbb talk contribs (→Infinitesimal asymptotics: {{math}}/{{mvar}} for inline maths for consistency with equations) Tag: 2017 wikitext editor

15 May 2025

• diffhist Shellsort 21:57 +53 Aphitor talk contribs (Reverted: Ciura gaps 156, 409, 995 are only optimal for N = 1000. Ciura conjectured that 132, 301, 701 will turn up optimal for larger N.)
• diffhist m Tree (abstract data type) 14:32 +102 Mindmatrix talk contribs (Reverted edit by 160.119.159.23 (talk) to last version by Pancho507) Tag: Rollback
• diffhist Tree (abstract data type) 14:17 −102 160.119.159.23 talk (Fixed some words) Tags: Reverted Mobile edit Mobile web edit
• diffhist Hash function 00:14 −87 Timde talk contribs (→External links: Remove broken tool)
• diffhist Hash function 00:13 −4 2620:15c:b5:2:a96e:89fe:b7b1:b42f talk (Fix broken link)

14 May 2025

• diffhist Depth-first search 19:40 +111 Bawolff talk contribs (→Pseudocode: add an interactive demo. This demo was made for Tree traversal but i think its useful here too. Regrettably it only shows a binary tree.)
• diffhist Leonardo number 12:56 −1 Usernamekiran talk contribs (rm stray space) Tags: Mobile edit Mobile web edit Advanced mobile edit
• diffhist Divide-and-conquer algorithm 09:50 +3 Tea2min talk contribs (→See also: Skip redirect in piped link.)
• diffhist m Linked list 06:22 +379 Meters talk contribs (Reverted edit by 61.255.236.83 (talk) to last version by HeartGlow30797) Tag: Rollback
• diffhist Linked list 06:15 −379 61.255.236.83 talk (→Linked lists vs. dynamic arrays) Tag: Reverted
• diffhist m Shellsort 04:48 +4 GCRhoads2 talk contribs (Replaced >= with greater than or equal sign.) Tag: Visual edit
• diffhist Shellsort 04:36 +391 GCRhoads2 talk contribs (Added my increment sequence to the table. Does better than every other sequence listed except the Ciura sequence when sorting 1000 elements) Tag: Visual edit: Switched
• diffhist Shellsort 04:18 −53 GCRhoads2 talk contribs (Changed the gaps in the pseudocode to Ciura's corrected sequence) Tag: Visual edit: Switched
• diffhist Shellsort 03:54 −9 GCRhoads2 talk contribs (Changed the Ciura sequence listed in the table to the one he actually claims has the smallest average number of comparisons among all known sequences when sorting 1000 elements. I have verified this claim for both 1000 and 5000 elements in an empirical test whose results are located at https://gcrhoads.byethost4.com/shellSort.html. Ciura *conjectured* that the optimal sequence for sorting large ( > 8000 elements) arrays, would *start* with the gaps listed in the removed sequence.) Tag: Visual edit

13 May 2025

• diffhist Spreadsort 21:12 +4,139 Ajmullen talk contribs (Added pseudocode) Tag: Visual edit
• diffhist Leonardo number 17:10 +4 Usernamekiran talk contribs (Undid revision 1290216038 by KiranBOT (talk)) Tag: Undo

12 May 2025

• diffhist Perl 19:52 +1,911 2600:100e:b12d:22f0:582:53b8:3460:9583 talk (Perl IDE/Debuggers ranked by ease of installation as of 2025.)
• diffhist Brute-force search 15:53 +531 Schlechter Verlierer talk contribs (added a link to the (current) infeasibility of 8-man chess endgame tablebases; link taken from Wikipedia's 'Endgame tablebase' article)
• diffhist Brute-force search 15:15 +426 Schlechter Verlierer talk contribs Tag: Undo
• diffhist Elo rating system 14:40 +1 Bruce leverett talk contribs (Undid revision 1290053715 by 83.185.87.217 (talk)) Tag: Undo
• diffhist Module:Lang 14:39 +98 Trappist the monk talk contribs
• diffhist Elo rating system 14:33 −1 83.185.87.217 talk Tag: Reverted
• diffhist Module:Lang/data 11:53 +226 Trappist the monk talk contribs (+trk-x-oldanat, et-x-seto, fr-x-frainc;)
• diffhist Trie 05:07 +72 NaomiAmethyst talk contribs (+audio)