forked from mandliya/algorithms_and_data_structures
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathhamming_distance.cpp
42 lines (33 loc) · 870 Bytes
/
hamming_distance.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
/**
The Hamming distance between two integers is the number of positions at which
the corresponding bits are different.
Given two integers x and y, calculate the Hamming distance.
Input: x = 1, y = 4
Output: 2
Explanation:
1 (0 0 0 1)
4 (0 1 0 0)
↑ ↑
The above arrows point to positions where the corresponding bits are different
*/
#include <iostream>
int hamming_distance(int x, int y)
{
// XOR will set only those bits in z which are different in x and y
int z = x ^ y;
// Now just count set bits in z.
int count = 0;
while (z)
{
count += (z % 2);
z >>= 2;
}
return count;
}
int main()
{
int x = 4;
int y = 1;
std::cout << "Hamming distance between " << x << " and " << y << " is : "
<< hamming_distance(x, y) << std::endl;
}