java indexof(String str) method complexity [duplicate]

by

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.

More Related Contents:

  1. How to remove repetition in output results in this code
  2. why i multiply many number make a mistake when i division?
  3. Random Number Algorithm – Implementation in Java
  4. Graph theory puzzle about connectivity?
  5. Data Structure in Java
  6. Write a program that takes an array/arraylist of integer and finds longest sub array/arraylist whose entries are equal [closed]
  7. How to check if an integer is in a set of given ranges? [closed]
  8. Algorithm to divide a given number in two proportions by one of the component of that number
  9. Java – class, get new array of objects
  10. Permutation of array
  11. How to merge two sorted arrays into a sorted array? [closed]
  12. What’s the best way to build a string of delimited items in Java?
  13. Generate all combinations from multiple lists
  14. Java, Shifting Elements in an Array
  15. How to count possible combination for coin problem
  16. A better algorithm to find the next palindrome of a number string
  17. Anagram algorithm in java
  18. Nice Label Algorithm for Charts with minimum ticks
  19. Hash Set and Array List performances
  20. implementing debounce in Java
  21. Is there an efficient algorithm for integer partitioning with restricted number of parts?
  22. How do I get the intersection between two arrays as a new array?
  23. What hashing function does Java use to implement Hashtable class?
  24. How to find the only number in an array that doesn’t occur twice [duplicate]
  25. ‘MergeSort Algorithm’ – What’s the better implementation in JAVA? [closed]
  26. The simplest algorithm for poker hand evaluation
  27. Can SHA-1 algorithm be computed on a stream? With low memory footprint?
  28. How does the Euclidean Algorithm work?
  29. Java Smooth Color Transition
  30. (a * b) / c MulDiv and dealing with overflow from intermediate multiplication

Leave a Comment