Anonymous user
Talk:Last letter-first letter: Difference between revisions
→Alternative methods?: new section
(→Alternative methods?: new section) |
|||
Line 90:
:::::Correct. If language-language speed comparisons of particular problems is truly desired, I'd need to set up some kind of controlled conditions. That would be painfully difficult to do properly and securely, considering competing interests and need to get language-specific tuning parameters correct. --[[User:Short Circuit|Michael Mol]] 12:57, 29 June 2011 (UTC)
::::::Also, the optimizations needed to get good speed (sometimes even just decent speed) out of certain tasks would make them hard to read, which IIRC was an important consideration. [[User:MagiMaster|MagiMaster]] 00:36, 30 June 2011 (UTC)
== Alternative methods? ==
I am toying with an annealing kind of code to make longest chains, and it was able to come up with a 241 sequence in a minute or so (645 names). For reference, for the 70 name sequence it was able to find a 21. If the full list can't be brute-forced, maybe some approximate methods would be interesting. --[[User:Ledrug|Ledrug]] 02:22, 30 June 2011 (UTC)
| |||