1. Modify the simplified Boyer-Moore algorithm presented in this chapter using ideas from the KMP algorithm so that it runs in O(n+m) time. 2. Give an example set of denominations of coins so that a...

1. Modify the simplified Boyer-Moore algorithm presented in this chapter using ideas from the KMP algorithm so that it runs in O(n+m) time.

2. Give an example set of denominations of coins so that a greedy changemaking algorithm will not use the minimum number of coins.

May 26, 2022