Anonymous user
Talk:Summarize and say sequence: Difference between revisions
→Caching
No edit summary |
|||
Line 42:
:::: For this task, it doesn't. It's just a matter of general correctness of getting the right length of any sequence. Suppose the task asked for shortest sequences, caching only sorted strings will lead to the conclusion that sequences from A and B are of the same length, while they are not. --[[User:Ledrug|Ledrug]] 17:43, 25 August 2011 (UTC)
::::: That would be a completely different algorithm. Furthermore, you should not want to find the sequence length for that task. --[[User:Rdm|Rdm]] 19:36, 25 August 2011 (UTC)
:::::: Er, don't take that example so literally. Suppose the question is, "of numbers 24132231 and 14233221, which has the longest sequence", for example (and no, don't take this example too literally, either. I'm just saying, only caching sorted string of each permutation has its problems.) --[[User:Ledrug|Ledrug]] 21:05, 25 August 2011 (UTC)
| |||