Search: C
-
merge sort
merge sort
-
MergeSort
Just my version of mergesort ....
-
binary search tree in C
implementation and some basic functions as: find next/previous, serch, add, delete etc.
you are more then welcome to send notes and corrections.
-
-
-
merge sort
merge sort
Request -
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.
-
Newton Raphson
This is a classic Newton-Raphson algorithm for finding the roots of a polynomial with one variant.
The algorithm is implemented in C, and requires nothing but a compiler to work.