A search algorithm that compares meta data of two strings, text or files and uses the meta data table to faster evaluate any differences. Any other search algorithm can be implemented after this check.

The time complexity to generate the meta data is O^(n). The time for actual comparion is m where m is the number of parameters in the meta-data.

• Count of characters
• Count of lowercase, uppercase characters
• Count of numbers
• Count of special characters
• File SHA-1 comparison

Pass two text files as arguements e.g.

./metacomp "file1" "file2"

The algorithm will let you know if the search was successful or not and why.