Anonymous user
Talk:Odd word problem: Difference between revisions
→Other References
(→Other References: this is a modified version of Dijkstra's problem) |
|||
Line 19:
::: 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)
* There is a [http://www.cs.utexas.edu/users/EWD/ Dijkstra archive at Utexas] that was linked from c2. Some of the material is searchable but for some reason isn't jumping out in google searches. This led to [http://www.cs.utexas.edu/users/EWD/transcriptions/EWD03xx/EWD302.html EWD302 and the Odd Word Problem]. --[[User:Dgamey|Dgamey]] 10:59, 4 November 2011 (UTC)
| |||