That's still O(n). Say you're looking for that string in a string of length n. Y... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

Epenthesis on Feb 23, 2011 | parent | context | favorite | on: Ask HN: Learning Complexity Classes

That's still O(n). Say you're looking for that string in a string of length n. You're search time will be n/16+c, which is O(n).

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact