I've seen different numbers of the complexity of this function. With a short string as a needle and a long string as haystack a worst case is clearly O(n) and a best (1).
My question, I've also seen O(log n), how is this complexity calculated or derived?
Ah I get it, it is wrong. The log n complexity is for binary trees. An average complexity for a string search like the one I proposed the complexity is O(n/2).Originally Posted by überfuzz
Yeah except that you drop the /2 when talking about Big-Oh notation.
My homepage
Advice: Take only as directed - If symptoms persist, please see your debugger
Linus Torvalds: "But it clearly is the only right way. The fact that everybody else does it some other way only means that they are wrong"
Ops, I shouldn't post when I'm drunk. Sorry!
I've made that mistake a few times. I would rather post while drunk then wake up to a mess I coded the night before while drunk.
Virtual reality hello world http://www.rodneybrothers.com/vr/vrh...rld/index.html in html and javascript.
Viewable with dodocase, google cardboard, OR, and other compatible VR gear.
Or, you know, you could stop getting drunk in the first place!
Yes, mom.
