Computer scienceAlgorithms and Data StructuresAlgorithmsString algorithmsSubstring search algorithms

Searching a substring

The number of comparisons

Report a typo

Select all correct statements about the simplest algorithm for searching substrings (assuming that $|t| \ge |p|$ ).

Select one option from the list

It performs no more than

|p| \cdot |p|

symbol comparisons for any pattern and text.

It performs no less than

|p|

symbol comparisons for any pattern and text.

It performs no less than

|t|

symbol comparisons for any pattern and text.

It performs no more than

|t| \cdot |p|

symbol comparisons for any pattern and text.

___

Create a free account to access the full topic