title: Compare two matching strings algorithms - Practical approach
body: <p>I wrote two differents algorithms that resolve some particular case of strings matching (implemented in C). I know that the theoretical O of this algorithms are equals but I think that in practical, one is better than the oder. 
  My question is, someone could recommend me some paper or some reading where shows how to compare algorithms with a practical approach? 
  I have several test set, I'm interested in measure execute time and memory size. I need take this values as independently as possible of the operating system and others program that could be runing concurrently.</p>
  
  <p>Thanks!!!</p>