algorithm - java indexof(String str) method complexity - Stack Overflow
The complexity of Java's implementation of indexOf is O(m*n) where n and m are the length of the search string and pattern respectively.
What you can do to improve complexity is to use e.g., the Boyer-More algorithm to intelligently skip comparing logical parts of the string which cannot match the pattern.
Read full article from algorithm - java indexof(String str) method complexity - Stack Overflow
No comments:
Post a Comment