time and space trade off

which if this is the variety of time and space trade off strategy?

• variable time decrease

• input enhancement

• restructuring input

• memory alllocation

When do we need to consider sacrificing the memory space?

• when we need a faster result

• when memory is not a problem

• When we dont have a powerfull processor

• When building an algorithm for a game

formula for d₁ value in bad match table is d_(i)=m-index- (a)  

Boyer Moore-Horspool algorithm.. (choose correct statements)

• uses only 1 table

• shift by selecting maximum value between d₁ and d₂

• improves the complexity of Boyer Moore's algorithm

• match from left to right (off the pattern)

Complexity of the brute force string matching algo is?

• O(mⁿ)

• O(mn)

• O(m+n)

• O(n)

Boyer Moore's Worse case complexity is____

• O(m+n)

• O(m/n)

• O(n)

• O(n-m)