Anonymous user
Talk:Odd word problem: Difference between revisions
multiple edits
(→Other References: fix typo) |
(multiple edits) |
||
Line 4:
:So this is a modified version of the problem that has been linked to? The solutions there seem to use buffers and peeking a lot. The site also says that the words will be a maximum of 20 characters long. Unless I'm missing changes in the spec later in the discussion, maybe there should be no link at all to that site (just to avoid confusion). --[[User:Mwn3d|Mwn3d]] 20:12, 3 November 2011 (UTC)
:: I only linked there for the problem description, not their solutions. C2.com isn't exactly known for its example code qualities. I couldn't find a good ref to the problem anywhere else, and Dijkstra's original is in a 200+ page pdf that requires subscription to download. If you think this task description is clear enough, feel free to remove the link. --[[User:Ledrug|Ledrug]] 20:46, 3 November 2011 (UTC)
I guess I need to further clarify: this is '''not''' about text processing. Reversing English words and reading/writing a-z is about as unineresting as it can get, just pretend they are some token irreversible action that's potentially very complicated and cannot be simply queued as data, and you need to perform them in certain order depending on the input. In a strict sense, the current python and go code aren't correct, either (passing saved data by return). --[[User:Ledrug|Ledrug]] 22:21, 3 November 2011 (UTC)
== Other References ==
* [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)
| |||