Talk:Odd word problem: Difference between revisions

 

Obviously, this task is not about text processing. Rather, it's about conditional code execution order. The even words are straightforward, while reversing odd words are easy with, say, recursion, with the catch that the word end marker (punctuation) needs to be processed ''after'' the recursion has returned. If peeking ahead is allowed, then this difficulty is removed and the whole thing becomes quite moot. --[[User:Ledrug|Ledrug]] 20:06, 3 November 2011 (UTC)

: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)

:# Or sometimes it can be good to state up-front what aspects of the task your language cannot handle before adding an example that doesn't answer the task for just those stated reasons.

:In the second case you shouldn't be surprised if the presence of the example is questioned, marked <nowiki>{{incorrect}}</nowiki>, or even deleted if people think it strays too far from the task description without much gain for the reader. --[[User:Paddy3118|Paddy3118]] 12:19, 7 August 2012 (UTC)

Is it time to move this task from draft?