Wikipedia:Articles for deletion/One-pass algorithm: Difference between revisions
Content deleted Content added
→One-pass algorithm: Speedy keep |
A note. |
||
Line 7:
Article has been unsourced since Jan 2007. Notability of topic is in question. [[User:Coin945|Coin945]] ([[User talk:Coin945|talk]]) 05:49, 13 April 2021 (UTC)
:<small class="delsort-notice">Note: This discussion has been included in the [[Wikipedia:WikiProject Deletion sorting/Computing|list of Computing-related deletion discussions]]. [[User:Shellwood|Shellwood]] ([[User talk:Shellwood|talk]]) 09:14, 13 April 2021 (UTC)</small>
** It's hard to find an actual source for this, but that's because (a) it's so basic and (b) this needs to be treated in a different way. [[Donald Knuth|Knuth]] discusses both single- and multiple- pass algorithms in ''TAoCP'', in the "Coroutines" section, if anyone wants to have Wikipedia discuss this in the way that an expert does. But I see no need for any administrator tools in renaming, refactoring, rewriting, and improving an article that ''one has researched''. [[User:Uncle G|Uncle G]] ([[User talk:Uncle G|talk]]) 10:43, 13 April 2021 (UTC)
* '''Speedy keep''', the nominator does not propose a valid [[WP:DEL-REASON]]. The nominator does not say which notability guideline this article fails to meet. [[User:SailingInABathTub|SailingInABathTub]] ([[User talk:SailingInABathTub|talk]]) 10:25, 13 April 2021 (UTC)
|