Computer scienceAlgorithms and Data StructuresAlgorithmsString algorithmsString similarity

Damerau–Levenshtein distance

Different strings and their complexity

Report a typo

What is the complexity of the algorithm with strings of lengths n and 3n?

Select one option from the list

O(n)

O(4n)

O(n^2)

O(\log(3n^2))

___

Create a free account to access the full topic