Revision as of 07:21, 29 December 2023 edit Pcordes (talk \| contribs) 80 edits →Single-pattern algorithms: As discussed earlier in the page, the average case for naive searching is Θ(n+m), when potential matches are rejected in O(1), not scaling with the total length of the needle. (I might have said "typical" instead of "average", but for consistency with the other entry let's say average) ← Previous edit		Revision as of 13:00, 24 January 2024 edit undo 190.96.105.113 (talk) →Overview Tag: Reverted Next edit →
Line 7: == Overview == The most basic case of string ~~searching~~writting involves one (often very long) string, sometimes called the ''haystack'', and one (often very short) string, sometimes called the ''needle''. The goal is to find one or more occurrences of the needle within the haystack. For example, one might search for ''to'' within: Some books are to be tasted, others to be swallowed, and some few to be chewed and digested.

String-searching algorithm: Difference between revisions