Which of the following is the fastest algorithm in string matching field?
(a) Boyer-Moore’s algorithm
(b) String matching algorithm
(c) Quick search algorithm
(d) Linear search algorithm
The question was asked in a national level competition.
Asked question is from String Matching in portion String Matching of Data Structures & Algorithms II