HammingDistance.cs

usingSystem;

namespaceAlgorithms.Strings.Similarity;

/// <summary>
/// <para>
/// Hamming distance between two strings of equal length is the number of positions at which the corresponding symbols are different.
/// Time complexity is O(n) where n is the length of the string.
/// </para>
/// <para>
/// Wikipedia: https://en.wikipedia.org/wiki/Hamming_distance.
/// </para>
/// </summary>
publicstaticclassHammingDistance
{
/// <summary>
/// Calculates Hamming distance between two strings of equal length.
/// </summary>
/// <param name="s1">First string.</param>
/// <param name="s2">Second string.</param>
/// <returns>Levenshtein distance between source and target strings.</returns>
publicstaticintCalculate(strings1,strings2)
{
if(s1.Length!=s2.Length)
{
thrownewArgumentException("Strings must be equal length.");
}

vardistance=0;
for(vari=0;i<s1.Length;i++)
{
distance+=s1[i]!=s2[i]?1:0;
}

returndistance;
}
}