Anonymous user
Talk:Odd word problem: Difference between revisions
→Other References: this is a modified version of Dijkstra's problem
(→Other References: this is a modified version of Dijkstra's problem) |
|||
Line 14:
* [http://drdobbs.com/cpp/184404529 Dr. Dobbs] The problem definition given here is slighty different. Punctuation is one or more blanks or a period. --[[User:Dgamey|Dgamey]] 22:17, 3 November 2011 (UTC)
: Yes I changed that, because with blanks you can't tell if the delimiters have been incorrectly swapped. --[[User:Ledrug|Ledrug]] 22:21, 3 November 2011 (UTC)
:: Just thinking aloud here as I have been down the path of a programming challenge before and there will be lots of discussion about the usefulness of the task or why this or that restriction is in place, how it's artificial, etc. --[[User:Dgamey|Dgamey]] 10:41, 4 November 2011 (UTC)
::: If you modify the original challenge, you risk breaking it. I'm not sure if that happened here or not. But when it's something that a Knuth or a Dijkstra published there is some historical value to it. If it's a modified challenge, then the task description should at least be clear on that point. --[[User:Dgamey|Dgamey]] 10:41, 4 November 2011 (UTC)
::: Not being easily able to find a solution or statement of the problem creates problems. It makes it harder to have a clear discussion about the intent. Or for that matter to compare. I've been disappointed by the small number of available references online for this and the general low quality of them. BTW did I mention I hate paywalls. --[[User:Dgamey|Dgamey]] 10:41, 4 November 2011 (UTC)
::: The code examples on c2 are not helpful. They code about breaking the rules right off the start. Very disorganized. --[[User:Dgamey|Dgamey]] 10:41, 4 November 2011 (UTC)
::: Some of what I've found (sorry forgot the reference) refers to a 20 character limitation per word and I've seen snippets that suggest that this is used inside the readword as a buffer to reverse the word. This would fly in face of the no buffer rule (2). But again it really is hampered by not having a visible source for the original problem and an example of the solution that Dijkstra's class/group came up with. --[[User:Dgamey|Dgamey]] 10:41, 4 November 2011 (UTC)
| |||