This is a set of three programme using three different algorithmes (Naive approach, using heap data structure, using hash tables ) in C lenguage. We calculate Livenshtein Distance to identify the similarity between two strings, if this similarity is bigger than or equal to a given proportion then one of them will be erased.
This is a set of three programme using three different algorithmes ( Naive approach, using heap data structure, using hash tables ) in C lenguage that uses the Livenshtein distance on diffe to calculate the similarity between two strings, if this similarity is bigger than or equal to a given proportion then one of them will be erased.
This is a set of three programme using three different algorithmes (Naive approach, using heap data structure, using hash tables ) in C lenguage. We calculate Livenshtein Distance to identify the similarity between two strings, if this similarity is bigger than or equal to a given proportion then one of them will be erased.
MIT License