Timeline for Find a string in the middle
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 28, 2023 at 6:19 | comment | added | Simd | Can you use wiki.haskell.org/Edit_distance. ? | |
| Aug 27, 2023 at 23:20 | history | edited | matteo_c | CC BY-SA 4.0 |
added 240 characters in body
|
| Aug 27, 2023 at 22:47 | history | edited | matteo_c | CC BY-SA 4.0 |
added 125 characters in body
|
| Aug 27, 2023 at 12:50 | comment | added | Simd | I added a test case where your code does not terminate. | |
| Aug 27, 2023 at 7:10 | comment | added | Simd | I fear your code might take exponential time. Try it with strings of length 50 to 100. | |
| Aug 26, 2023 at 21:56 | comment | added | xnor | Are you sure this runs in quadratic time? | |
| Aug 26, 2023 at 20:06 | comment | added | Wheat Wizard♦ |
You can also combine the 4th and 6th lines into a@(x:w)#b|y:z<-b=sortOn l[a:w#b,a#z++[b],a:map(y:)(w#z)]!!0|1>0=a:w#[], to save 5 more bytes.
|
|
| Aug 26, 2023 at 20:03 | comment | added | Wheat Wizard♦ |
You can save 2 bytes by replacing head with !!0.
|
|
| Aug 26, 2023 at 19:36 | comment | added | Simd | Thanks for giving the first answer! | |
| Aug 26, 2023 at 19:33 | history | answered | matteo_c | CC BY-SA 4.0 |