Talk:Verhoeff algorithm: Difference between revisions
m
→Omitted algorithm
| (3 intermediate revisions by 2 users not shown) | |||
Line 15:
:::::Well, if anyone thinks they can improve on the clarity of the Wikipedia article, they're welcome to try. --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 18:52, 25 February 2022 (UTC)
::::::The wikipedia article is fine for wikipedia. But it contains a lot of content which doesn't need to be here on rosettacode.
::::::Anyways, some of what it says -- probably the tables -- should be reflected here on rosettacode for our task description. That said, it might make sense to create a dihedral group task, and refer to that for a bulk of the description. --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 19:02, 25 February 2022 (UTC)
:::::::I don't know about that but, if anyone fancies themselves as a technical writer, they won't have to look very far for more work. The related [https://rosettacode.org/wiki/Damm_algorithm Damm Algorithm] task, which is not one of mine, also relies on the eponymous Wikipedia article for its description. --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 19:43, 25 February 2022 (UTC)
:::::::: Yeah, we've been lazy here, and it's probably going to take years to clean up all of the messes. --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 19:52, 25 February 2022 (UTC)
::"lengthy and needless repetition..." I resemble that remark. I usually try to err on the side of too much information rather than not enough. Not 100% of the time but pretty darn often. --[[User:Thundergnat|Thundergnat]] ([[User talk:Thundergnat|talk]]) 11:21, 25 February 2022 (UTC)
| |||