Which of the following string matching algorithms uses a "shift" table to skip unnecessary comparisons?

Which string matching algorithm is known for its preprocessing phase to create a partial match table?

A. Naive Search

B. Rabin-Karp

C. Boyer-Moore

D. Knuth-Morris-Pratt (KMP)

What is the time complexity of the Boyer-Moore string matching algorithm in the best case?

A. O(m + n)

B. O(n)

C. O(m/n)

D. O(m log n)

Which string matching algorithm uses hashing to achieve its results?

A. Boyer-Moore

B. Rabin-Karp

C. Naive Search

D. Boyer-Moore

In which scenario does the Naive string matching algorithm perform well?

A. When using a large alphabet.

B. When there are many potential matches.

C. When both the pattern and text are very short.

D. When the pattern is long and the text is large.