find() under the hood

Calculate the number of steps

Report a typo

Your task is to find gale in nightingale. How many comparisons will it take for the naive algorithm, and how many for the Horspool?

Select one option from the list

12 for the naive algorithm and 3 for the Horspool

17 for the naive algorithm and 4 for the Horspool

11 for the naive algorithm and 9 for the Horspool

12 for the naive algorithm and 6 for the Horspool

___

Create a free account to access the full topic