Source code for algorithms.searching.bmh_search

"""
    BMH Search
    ----------
    Search that attempts to find a substring in a string. Uses a bad-character
    shift of the rightmost character of the window to compute shifts.

    Time: Complexity: O(m + n), where m is the substring to be found.

    Space: Complexity: O(m), where m is the substring to be found.

    Psuedo Code: https://github.com/FooBarWidget/boyer-moore-horspool

"""