Hamming Distance

External

• https://en.wikipedia.org/wiki/Hamming_distance

Internal

• Clustering Concepts

Overview

The Hamming distance between two string of equal length is the number of positions at which the corresponding symbols are different. In other words, it measures the minimum number of substitutions required to change on string into the other, or the minimum number of errors that could have transformed one string into the other.

Implementations

Hamming Distance between Two Integers in Java

public static int hammingDistance(int i1, int i2) {
  int differences = 0;
  int xor = i1 ^ i2;
  while(xor > 0) {
    differences += xor & 1;
    xor >>= 1;
  }
  return differences;
}

Also see:

Integer Bitwise XOR ^ in Java