My Algorithms
-
RLE Run Length Encoding
Run-length encoding (RLE) is a simple form of data compression in which runs of data are stored as a single data value and count.
This is most useful on data that contains many such runs: for example, relatively simple graphic images such as icons, line drawings, and animations. This method was used for Fax encoding.
-
Karp-Rabin algorithm for Exact String Matching
Rabin-Karp algorithm for exact string matching. This algorithm uses hashing to find any one of a set of pattern strings in the text.
preprocessing O(m) time complexity with constant space. Searching in O(mn) time complexity. Expected running time is O(n+m).
Based on www-igm.univ-mlv.fr/~lecroq/string with input and output. Ready to run.
-
Knuth Morris Pratt (KMP) algorithm for Exact String Matching
Knuth-Morris-Pratt algorithm for Exact String Matching. Preprocessing phase takes O(m) space complexity. Same for time complexity. searching phase takes a O(n+m) time complexity (non dependent on alphabet size).
Based on www-igm.univ-mlv.fr/~lecroq/string/ with added input and output and a minor bug fix.
-
Exact String Matching Brute Force
No preprocessing brute force Exact String Matching. Searching in O(mn) time complexity with 2n text characters comparisons.
My Algorithm Requests
No requests posted yet.