Talk:Sort the letters of string in alphabetical order: Difference between revisions

Line 85:
::# It's a question of domain, and how to handle values outside the domain. Let's assume the task-author agrees to provide sample input/output strings in order to demonstrate the intended collation sequence, but still allows implementations to choose their OWN input strings, natural to their language (as is currently the case). If, hypothetically, the task-author failed to include/demonstrate the sorting of punctuation, then how should an implementation handle punctuation characters if encountered? Either that, or require the use of the example input, and accept only the example output. (eliminating free choice input entirely, so that the domain of characters is predetermined)
::If the task-writer merely wants characters of a string sorted by whatever machine-collation (whether ASCII, EBCDIC or other) happens to be in effect, then I'd recommend the task be written in simpler terms, so as not to suggest that something more might have been intended. --[[User:Davbol|Davbol]] ([[User talk:Davbol|talk]]) 05:38, 13 August 2022 (UTC)
 
::: Indeed "natural to the language" and the most typical meaning for "natural" represent very different concepts (and rely on different "natural language" definitions of the adjective).
::: But perhaps you could suggest a better phrasing which you think would serve here? --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 07:53, 13 August 2022 (UTC)
6,962

edits