Jump to content
Wikipedia The Free Encyclopedia

Talk:Two-way string-matching algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This article is rated C-class on Wikipedia's content assessment scale.
It is of interest to the following WikiProjects:
WikiProject icon Computer science
WikiProject icon This article is within the scope of WikiProject Computer science , a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science
??? This article has not yet received a rating on the project's importance scale.
Things you can help WikiProject Computer science with:
WikiProject icon Computing : Software / CompSci Low‐importance
WikiProject icon This article is within the scope of WikiProject Computing , a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing
Low This article has been rated as Low-importance on the project's importance scale.
Taskforce icon
This article is supported by WikiProject Software .
Taskforce icon
This article is supported by WikiProject Computer science (assessed as Mid-importance).
Things you can help WikiProject Computer science with:

error in maximal_suffix fun in two way string matching algorithm

[edit ]

I tested the maximal suffix fun, and I guess it is not correct? 87.236.233.51 (talk) 08:02, 19 December 2024 (UTC) [reply ]

AltStyle によって変換されたページ (->オリジナル) /