Related changes
Appearance
Enter a page name to see changes on pages linked to or from that page. (To see members of a category, enter Category:Name of category). Changes to pages on your Watchlist are shown in bold with a green bullet. See more at Help:Related changes.
List of abbreviations (help):
- D
- Edit made at Wikidata
- r
- Edit flagged by ORES
- N
- New page
- m
- Minor edit
- b
- Bot edit
- (±123)
- Page byte size change
- Temporarily watched page
19 May 2025
- diffhist Arithmetic progression 04:36 +273 2600:1012:a024:a5c0:5540:b7d8:4d6a:270a talk (→Sum: Added a source about infinite arithmetic series being divergent to stop complaints about the content addition)
- diffhist Arithmetic progression 04:19 −9 2600:1012:a024:a5c0:5540:b7d8:4d6a:270a talk (→Sum)
- diffhist Arithmetic progression 04:17 +239 2600:1012:a024:a5c0:5540:b7d8:4d6a:270a talk (Undid revision 1291085454 by JayBeeEll (talk) I provided the burden. Now it's your turn. Hypocritical for you to keep sticking to stubbornness even after I provided what was demanded, while you don't do your part.) Tag: Undo
- 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 Algorithm 00:39 −28 David Eppstein talk contribs (I don't think this essay-like cleanup banner is valid)
- diffhist Arithmetic progression 00:14 −239 JayBeeEll talk contribs (Undid revision 1291075360 by 2600:1012:A024:A5C0:5540:B7D8:4D6A:270A (talk) per WP:BURDEN, "The burden to demonstrate verifiability lies with the editor who adds or restores material") Tags: Undo Reverted
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 Arithmetic progression 22:33 +239 2600:1012:a024:a5c0:5540:b7d8:4d6a:270a talk (Undid revision 1291046279 by JayBeeEll (talk) Wrong. I have sources.) Tags: Undo Reverted
- diffhist Arithmetic progression 18:57 −239 JayBeeEll talk contribs (Reverted 5 edits by 2600:1012:A021:7A65:AD81:13C9:15D2:E5DF (talk): I don't think this is an improvement; in particular, I don't believe RS support the idea that the (always divergent) infinite sums of this kind are called arithemtic series) Tags: Twinkle Undo Reverted
17 May 2025
- diffhist Arithmetic progression 15:17 −6 2600:1012:a021:7a65:ad81:13c9:15d2:e5df talk (You don't need to boldface twice in the article) Tag: Reverted
- diffhist Arithmetic progression 15:10 +6 2600:1012:a021:7a65:ad81:13c9:15d2:e5df talk (→Sum) Tag: Reverted
- diffhist Arithmetic progression 15:09 +47 2600:1012:a021:7a65:ad81:13c9:15d2:e5df talk (→Sum) Tag: Reverted
- 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
- diffhist Arithmetic progression 04:03 +1 2600:1012:a021:7a65:ad81:13c9:15d2:e5df talk (→Sum) Tag: Reverted
- diffhist Arithmetic progression 04:03 +191 2600:1012:a021:7a65:ad81:13c9:15d2:e5df talk (→Sum: Introduced content about infinite arithmetic series so that the idea is mentioned "somewhere" in the article. Feel free to update the article with more, better explained content about it.) Tag: Reverted
- diffhist Tree structure 01:38 −23 Fuddle talk contribs (removed Category:Structure using HotCat covered by narrower cat)
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 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 Help:Maintenance template removal 04:17 +2 GianniLT talk contribs
- diffhist m Help:Maintenance template removal 04:16 +2 GianniLT talk contribs
14 May 2025
- 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