-
Notifications
You must be signed in to change notification settings - Fork 3
/
hamming_distance.c
45 lines (41 loc) · 933 Bytes
/
hamming_distance.c
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
43
44
45
/* 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.
*
* Note:
* 0 ≤ x, y < 231.
*
* Example:
* 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 <stdio.h>
int hammingDistance(int, int);
int main()
{
int x;
int y;
printf("Enter the 1st integer: ");
scanf("%d", &x);
printf("Enter the 2nd integer: ");
scanf("%d", &y);
int ham_distance = hammingDistance(x , y);
printf("Hamming distance between x & y is %d\n", ham_distance);
}
int hammingDistance(int x, int y)
{
int z = x ^ y;
int count = 0;
while(z)
{
count += z % 2;
z >>= 1;
}
return count;
}