Clearly, this algorithm runs in o (mn) time.

显然，这个算法的运行时间为O (mn)。

youdao

Note that the running time for the Levenshtein algorithm is always o (mn).

请注意：Levenshtein算法的运行时间总是O (mn)。

youdao

Scanning every customer is approximately o (m), not o (MN), because almost all customer vectors contain a small number of items, regardless of the size of the catalog.

扫描每一个顾客大约是O (M)，而不是O (MN)，因为几乎所有顾客向量都只含有很少的商品，无需考虑产品目录的规模。

youdao

Scanning every customer is approximately o (m), not o (MN), because almost all customer vectors contain a small number of items, regardless of the size of the catalog.

扫描每一个顾客大约是O (M)，而不是O (MN)，因为几乎所有顾客向量都只含有很少的商品，无需考虑产品目录的规模。

youdao