Re:New string search algorithm
by Locke1689 on Friday February 11, 2011 @08:40PM
(#2208984)
Exponential growth is O(2^m). This is not pedantic -- it's definition. O(m^k) is polynomial, O(k^m) is exponential.
[ Parent
| on HN ]
There are no comments on this comment yet.