Talk:Palindrome detection: Difference between revisions
→Spaces and punctuation
Line 20:
::::: Sure, understood. I think people are just pointing out that the task description was not as clear to some of us as you wanted it to be, partly because the term "palindrome" is not actually defined in the task. The linked Wikipedia article focuses mostly on natural language palindromes, as does the Latin example. As a linguist myself, I admit I find those more interesting than formal strings, and both are valid. For your more restrictive and computationally general idea, maybe specifying a formal mathematical statement of a palindromic sequence would have helped. In any case, the one type of solution is convertible to the other with a little extra string handling, so it's not a huge deal. And thanks for the explanations of your POV. --[[User:Snoman|Snoman]] 08:39, 13 July 2010 (UTC)
:::::: I would recommend a rephrasing:
:::::: "This task requires a modular design: You must implement a function which tests if an arbitrary sequence of characters or bytes is a palindrome. You must also implement a wrapper which normalizes text, removing spaces, case differences, and punctuation." --[[User:Rdm|Rdm]] 14:21, 13 July 2010 (UTC)
----
| |||