+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+|
+ Algorithms_in_C 1.0.0
+
+ Set of algorithms implemented in C.
+ |
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+Loading...
+Searching...
+No Matches
+
+
+
+
+hamming_distance.c File Reference
+
+
+
+
+
+
+Hamming distance algorithm implementation. +More...
+#include <assert.h>+
#include <stdio.h>+
+Include dependency graph for hamming_distance.c:
+
+
+
+
++Functions | |
| int | hamming_distance (char *str1, char *str2) |
| for assert | |
| static void | test () |
| Self-test implementations. | |
| int | main () |
| Main function. | |
Detailed Description
+Hamming distance algorithm implementation.
+In information theory, the Hamming distance between two strings of equal length is the number of positions at which the corresponding symbols are different.
+Function Documentation
+ +◆ hamming_distance()
+ +
+
+
+
+
+
+
| int hamming_distance | +( | +char * | +str1, | +
| + | + | char * | +str2 | +
| + | ) | ++ |
+
+
+
+for assert
+for IO operations
+Function to calculate the Hamming distance between two strings
- Parameters
-
+
+
+param1 string 1 param2 string 2
+
- Returns
- Hamming distance
22{
+ 23 int i = 0, distance = 0;
+ 24
+ 25 while (str1[i] != '\0')
+ 26 {
+ 27 if (str1[i] != str2[i])
+ 28 {
+ 29 distance++;
+ 30 }
+ 31 i++;
+ 32 }
+ 33
+ 34 return distance;
+ 35}
+◆ main()
+ +
+
+
+
+
+
+
+| int main | +( | +void | +) | ++ |
◆ test()
+ +
+
+
+
+
+
+
|
+ +static | +
+
+
+
+Self-test implementations.
+- Returns
- void
42{
+ 43 char str1[] = "karolin";
+ 44 char str2[] = "kathrin";
+ 45
+ 46 assert(hamming_distance(str1, str2) == 3);
+ 47
+ 48 char str3[] = "00000";
+ 49 char str4[] = "11111";
+ 50
+ 51 assert(hamming_distance(str3, str4) == 5);
+ 52 printf("All tests have successfully passed!\n");
+ 53}
+int hamming_distance(char *str1, char *str2)
for assert
Definition: hamming_distance.c:21
+Here is the call graph for this function:
+
+
+
+
+
+
+
+
+
diff --git a/d5/da4/hamming__distance_8c.js b/d5/da4/hamming__distance_8c.js
new file mode 100644
index 00000000..4ccc9b8d
--- /dev/null
+++ b/d5/da4/hamming__distance_8c.js
@@ -0,0 +1,6 @@
+var hamming__distance_8c =
+[
+ [ "hamming_distance", "d5/da4/hamming__distance_8c.html#ab7a7bac10f43dd5d2d064553fbf2cd7a", null ],
+ [ "main", "d5/da4/hamming__distance_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
+ [ "test", "d5/da4/hamming__distance_8c.html#aa8dca7b867074164d5f45b0f3851269d", null ]
+];
\ No newline at end of file
diff --git a/d5/da4/hamming__distance_8c_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d5/da4/hamming__distance_8c_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
new file mode 100644
index 00000000..fdf85cd1
--- /dev/null
+++ b/d5/da4/hamming__distance_8c_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
@@ -0,0 +1,4 @@
+
diff --git a/d5/da4/hamming__distance_8c_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d5/da4/hamming__distance_8c_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
new file mode 100644
index 00000000..d39e5d23
--- /dev/null
+++ b/d5/da4/hamming__distance_8c_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
@@ -0,0 +1 @@
+ff2f15778b5f4c7322a58fc3be336c87
\ No newline at end of file
diff --git a/d5/da4/hamming__distance_8c_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d5/da4/hamming__distance_8c_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
new file mode 100644
index 00000000..8ebebe36
--- /dev/null
+++ b/d5/da4/hamming__distance_8c_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
@@ -0,0 +1,36 @@
+
+
+
+
+
diff --git a/d5/da4/hamming__distance_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d5/da4/hamming__distance_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
new file mode 100644
index 00000000..e5ba1378
--- /dev/null
+++ b/d5/da4/hamming__distance_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
@@ -0,0 +1,5 @@
+
diff --git a/d5/da4/hamming__distance_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d5/da4/hamming__distance_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
new file mode 100644
index 00000000..14de7e19
--- /dev/null
+++ b/d5/da4/hamming__distance_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
@@ -0,0 +1 @@
+5c6f014b641b3b96c63fd7309daf0c31
\ No newline at end of file
diff --git a/d5/da4/hamming__distance_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d5/da4/hamming__distance_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
new file mode 100644
index 00000000..03259a8c
--- /dev/null
+++ b/d5/da4/hamming__distance_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
@@ -0,0 +1,51 @@
+
+
+
+
+
diff --git a/d7/d1a/hamming__distance_8c__incl.map b/d7/d1a/hamming__distance_8c__incl.map
new file mode 100644
index 00000000..24e3ab4a
--- /dev/null
+++ b/d7/d1a/hamming__distance_8c__incl.map
@@ -0,0 +1,5 @@
+
diff --git a/d7/d1a/hamming__distance_8c__incl.md5 b/d7/d1a/hamming__distance_8c__incl.md5
new file mode 100644
index 00000000..3ada5ebb
--- /dev/null
+++ b/d7/d1a/hamming__distance_8c__incl.md5
@@ -0,0 +1 @@
+a6856dda5db5a4203bb31f8b206dc59b
\ No newline at end of file
diff --git a/d7/d1a/hamming__distance_8c__incl.svg b/d7/d1a/hamming__distance_8c__incl.svg
new file mode 100644
index 00000000..60f71a64
--- /dev/null
+++ b/d7/d1a/hamming__distance_8c__incl.svg
@@ -0,0 +1,51 @@
+
+
+
+
+
diff --git a/dir_a52f4d3d586a58b02f3a4ddf0a992157.html b/dir_a52f4d3d586a58b02f3a4ddf0a992157.html
index e4bcc2d3..ccb53a9f 100644
--- a/dir_a52f4d3d586a58b02f3a4ddf0a992157.html
+++ b/dir_a52f4d3d586a58b02f3a4ddf0a992157.html
@@ -103,6 +103,9 @@ $(document).ready(function(){initNavTree('dir_a52f4d3d586a58b02f3a4ddf0a992157.h
-
+
+
- Generated by
1.9.6
+
Files | |
| file | hamming_distance.c |
| Hamming distance algorithm implementation. | |
| file | poly_add.c |
| Implementation of [Addition of two polynomials] (https://en.wikipedia.org/wiki/Polynomial#Addition) | |
| ► misc | |
| ► numerical_methods | |