What character shift tables does Boyer-Moore’s search algorithm use?
(a) good-character shift tables
(b) bad-character shift tables
(c) next-character shift tables
(d) both good and bad character shift tables
This question was posed to me in semester exam.
My enquiry is from String Matching topic in section String Matching of Data Structures & Algorithms II