In computer science, the Boyer–Moore string search algorithm is an efficient string searching algorithm that is the standard benchmark for practical string search literature.It was developed by Robert S. Boyer and J Strother Moore in 1977.The algorithm preprocesses the string being searched for (the pattern), but not the string being searched in (the text).
The key features of the algorithm are to match on the tail of the pattern rather than the head, and to skip along the text in jumps of multiple characters rather than searching every single character in the text. (Source:Wikipedia )
Following code is an implementation of Boyer-Moore uses PL/SQL
TEXT:='You have got a funny face, man'; --NOT FOUND
TEXT:='I wish I had_an apple instead of'; --NOT FOUND
-- NOT FOUND