Naive Algorithm for Pattern Searching

[_Phobos]

Is anyone doing this in LabVIEW?

https://www.geeksforgeeks.org/naive-algorithm-for-pattern-searching/

just curious. 

[Basjong53 · Accepted solution]

Use the "Match Pattern" primitive.

[altenbach]

Just another possibility....

[alexderjuengere]

i overlooked (n-m) +1 ... 🙈

[_Phobos]

That works! Thank you!

[_Phobos]

I have a couple questions. If LabVIEW is zero indexed, I understand why the last search result is 12. What about 9, the second search result? Shouldn’t the output be 0,8,12 if LabVIEW is zero indexed?

The original GeeksForGeeks example output is: 0,9,13. 

[_Phobos]

Maybe there’s a typo in the generated output? The original “calculated” output is 0,9,12.  

[Basjong53]

---

@_Phobos  ha scritto:

I have a couple questions. If LabVIEW is zero indexed, I understand why the last search result is 12. What about 9, the second search result? Shouldn’t the output be 0,8,12 if LabVIEW is zero indexed?

The original GeeksForGeeks example output is: 0,9,13. 

---

Your example is also 0-indexed. With the found indices at 0, 9 and 12. Why do you think the second index should be 8?

[_Phobos]

Look further down the page. The Output lists 0, 9, 13. This is not consistent with 0, 9, 12. I think there is a typo in the Output. 

 

[_Phobos]

The 9th element in a zero-indexed sequence would be 8. The 13th element in a zero-indexed sequence would be 12.