Talk:Anagrams: Difference between revisions
(New section: Where to read wordlist from?) |
m (there's also a J version in the first category) |
||
| Line 8: | Line 8: | ||
== Where to read wordlist from? == |
== Where to read wordlist from? == |
||
The Haskell |
The Haskell and J versions assumes a local copy of the file, while the other two examples so far open the URL directly. What is the intention behind the task? |
||
I would consider opening the URL directly an unnecessary complication: Not every language allows easy access to the internet, but the rest of the task is basically algorithmic, and therefore easily accessible to any language. If the internet access is indeed intended to be part of the task, I propose splitting this task into two separate ones: |
I would consider opening the URL directly an unnecessary complication: Not every language allows easy access to the internet, but the rest of the task is basically algorithmic, and therefore easily accessible to any language. If the internet access is indeed intended to be part of the task, I propose splitting this task into two separate ones: |
||
Revision as of 16:36, 2 October 2008
Yep, I know now, they are not acronyms. --Paddy3118 20:34, 24 September 2008 (UTC)
- Do you want to call them "anagrams" instead? --DanBron 18:04, 25 September 2008 (UTC)
That's it! Of course they are. I must have had a brain seizure!! --Paddy3118 20:51, 25 September 2008 (UTC)
Local word list
Could an administrator make a local copy of the wordlist? --Paddy3118 05:37, 2 October 2008 (UTC)
Where to read wordlist from?
The Haskell and J versions assumes a local copy of the file, while the other two examples so far open the URL directly. What is the intention behind the task?
I would consider opening the URL directly an unnecessary complication: Not every language allows easy access to the internet, but the rest of the task is basically algorithmic, and therefore easily accessible to any language. If the internet access is indeed intended to be part of the task, I propose splitting this task into two separate ones:
- read a file from the web
- find most words of equal characters based on a file of words
That would IMHO be better, because it's more modular. --Ce 16:35, 2 October 2008 (UTC)