Can someone please help me understanding which one is more efficient strstr() or KMP as recently I was doing a question on SPOJ and found that strstr() was in one way or other faster than KMP.. someone please explain the mystery behind this..
strstr() vs Knuth Morris Pratt
2.4k Views Asked by Chandan Mittal At
1
There are 1 best solutions below
Related Questions in STRSTR
- Saving multiple occurrences of strstr() from a line in C?
- How to print only the first sentence in string [C]?
- strstr - Not working correctly with XML Response (Symbols)
- Using strstr to determine if a given string contains a string with spaces [C]
- c++ string pattern matching buffer data
- How to search for a string pattern inside html, coding in C?
- c for loop break statement doesn't work
- Yii criteria params array whit strstr function
- strstr() vs Knuth Morris Pratt
- I am trying to compile a simple string but it does not work... why?
- Trying to replace a word within a cstring
- Getting the part of a string after the occurrence of last backslash
- Find string that contains substring from redirected file, but keep getting Seg-fault?
- How to extract occurrence of str + digits from string in C
- extract Location from http socket
Related Questions in KNUTH-MORRIS-PRATT
- What is the function for the KMP Failure Algorithm?
- Difference Between KMP and Regex/DFA-based Searching
- KMP algorithm worst case analysis
- Knuth-Morris-Pratt algorithm corner-case
- strstr() vs Knuth Morris Pratt
- What are the available string matching algorithms besides Knuth-Morris-Pratt, Rabin-Karp and likes of it?
- Why can the KMP failure function be computed in O(n) time?
- Find the smallest period of input string in O(n)?
- KMP Preprocessing Function
- Efficient Pattern Matching / String Merging Algorithm
- how many distinct substrings of string A that don't contain string B as a substring
- What is the minimum number of comparisons under best case for KMP Algorithm?
- What is the best & worst time complexity Of KMP algorithm
- Java: KMP matcher algorithm
- C++ String Comperison - Why Brute Force alg, works faster than my Knuth–Morris–Pratt alg - I know there must a mistake but I don't know were
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
You are comparing apples with pears, strstr() is a function to find substrings, KMP is an algorithm to do it, so strstr() could theoretically be implemented using KMP. You need to find out which algorithm is the strstr() in question implementing to give a statement.
Take a look at this answer and the comments on it.