Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
Locke1689
on Feb 12, 2011
|
parent
|
context
|
favorite
| on:
New string search algorithm
Exponential growth is O(2^m). This is not pedantic -- it's definition. O(m^k) is polynomial, O(k^m) is exponential.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: