Timeline for Search String Algorithm in Table
Current License: CC BY-SA 3.0
18 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 4, 2016 at 9:15 | comment | added | David Richerby | @Raphael No. The problem is still mostly described using examples, though some cases now have a specification. Why does input AB produce Y0 and not Y1? Am I always supposed to go for an exact match of the template versus the template being a substring of the record? | |
| Jul 4, 2016 at 8:54 | comment | added | Raphael | @DavidRicherby Is it better now? | |
| Jul 3, 2016 at 21:20 | history | reopened |
Evil Rick Decker D.W.♦ |
||
| S Jul 1, 2016 at 10:50 | history | suggested | Jon McClung | CC BY-SA 3.0 |
further explained the requirements of the algorithm, namely that the elements near the beginning of the output must have as long a string as possible.
|
| Jul 1, 2016 at 3:32 | comment | added | D.W.♦ | I still don't understand what problem you are trying to solve. You need to specify the inputs, the outputs, and precisely what property the correct output must satisfy. You can't specify an algorithm by listing examples. | |
| Jul 1, 2016 at 3:13 | review | Suggested edits | |||
| S Jul 1, 2016 at 10:50 | |||||
| Jun 30, 2016 at 10:14 | comment | added | David Richerby | Can you please describe what is the problem you are trying to solve. Worked examples aren't enough: what is the actual problem? Why, when ABCDE and ABCD fail, do you move on to ABC rather than BCDE? | |
| Jun 30, 2016 at 8:08 | review | Reopen votes | |||
| Jul 3, 2016 at 21:23 | |||||
| S Jun 30, 2016 at 7:49 | history | suggested | Jon McClung | CC BY-SA 3.0 |
added explanation of what the user is looking for.
|
| Jun 30, 2016 at 1:14 | review | Suggested edits | |||
| S Jun 30, 2016 at 7:49 | |||||
| Jun 29, 2016 at 15:48 | history | closed |
David Richerby D.W.♦ |
Needs details or clarity | |
| Jun 29, 2016 at 15:30 | answer | added | Jon McClung | timeline score: 2 | |
| Jun 29, 2016 at 14:33 | comment | added | David Richerby | "I am trying to solve this problem efficiently" I can't understand your description of the problem. | |
| Jun 29, 2016 at 13:32 | comment | added | Raven | Basically you just need to check if there is a match on 1 of the rows in the table. But you have to do it in a way that it searches first for the longest string. | |
| Jun 29, 2016 at 12:42 | review | Close votes | |||
| Jun 29, 2016 at 15:51 | |||||
| Jun 29, 2016 at 12:25 | comment | added | David Richerby | I'm sorry but I don't understand your question. Could you give a clear explanation of what you want this algorithm to do? | |
| Jun 29, 2016 at 11:06 | review | First posts | |||
| Jun 29, 2016 at 12:25 | |||||
| Jun 29, 2016 at 11:02 | history | asked | Raven | CC BY-SA 3.0 |