算法比BMH（Boyer–Moore–Horspool）搜索更快

本文介绍了算法比BMH（Boyer–Moore–Horspool）搜索更快的处理方法，对大家解决问题具有一定的参考价值，需要的朋友们下面随着小编来一起学习吧！ 问题描述

您将使用哪种算法来搜索短文本中的短子字符串？简而言之，我的意思是子字符串5-10个字符，字符串255个。我正在考虑根据输入数据长度选择算法。哪种算法更适合较长的输入？

Which algorithm would you use to search short substrings in short texts? By short I mean 5-10 characters for substring and 255 for the string. I'm thinking about choosing algorithm depending on input data length. Which algorithm is better for longer inputs?

推荐答案

尝试 Turbo-BM 。但是，IMO这样短的字符串通常可以进行线性扫描。

Try Turbo-BM. However, IMO, with such short strings usual linear scan will suffice.