答案及解析：[单选题]We are search a pattern of size m in a text string of size n using the BM algorithm with BC+GS strat

问题：

[单选题]We are search a pattern of size m in a text string of size n using the BM algorithm with BC+GS strategy. What's the time complexity for the best/worst case?
在长度为n的文本串中查找长度为m的模式串
使用BC+GS策略的BM算法，最好和最坏情况下的时间复杂度分别为：
AO(n), O(m+n)
BO(n/m), O(m+n)
CO(n+m), O(mn)
DO(m), O(mn)