Computer scienceProgramming languagesPythonAdditional instrumentsAlgorithms and data structures

find() under the hood

The big-O

Report a typo

If you're going to use an algorithm, it's important to know its complexity. Match the values in the columns. Remember that $n$ is the length of the string, and $m$ is the length of the search pattern.

Match the items from left and right columns

Average-case complexity

Worst case

Best case

sublinear

O(n)

O(nm)

___

Create a free account to access the full topic