[Feature] Added Binary complement.

Author: exterkamp

README.md

@@ -50,8 +50,9 @@ $ coverage report -m
 Different algorithmic programs.  Grouped by general topic.
 
 #### Bitwise Algorithms
-* [Hamming Distance](algorithms/bitwise/operations.py)
-* [Hamming Weight](algorithms/bitwise/operations.py)
+* [Hamming Distance](algorithms/bitwise/hamming_ops.py)
+* [Hamming Weight](algorithms/bitwise/hamming_ops.py)
+* [Binary Complement](algorithms/bitwise/complement.py)
 
 #### Mathematical Algorithms
 * [Fibonacci](algorithms/math/fibonacci.py)

algorithms/bitwise/complement.py

@@ -0,0 +1,12 @@
+def complement(num):
+    """
+    Find the non-zero padded binary compelement.
+
+    """
+    if not num:
+        return 1
+    i = 1
+    while i <= num:
+        num ^= i
+        i = i << 1
+    return num

algorithms/bitwise/operations.py renamed to algorithms/bitwise/hamming_ops.py

@@ -0,0 +1,10 @@
+import unittest
+from algorithms.bitwise.complement import complement
+
+class TestComplement(unittest.TestCase):
+
+    def test_complement(self):
+        self.assertEqual(0b010, complement(0b101))
+        self.assertEqual(0b01, complement(0b10))
+        self.assertEqual(0b0011000101000001111, complement(0b1100111010111110000))
+        self.assertEqual(0b1, complement(0b0))

tests/test_complement.py

@@ -1,5 +1,5 @@
 import unittest
-from algorithms.bitwise.operations import hamming_distance, hamming_weight
+from algorithms.bitwise.hamming_ops import hamming_distance, hamming_weight
 
 class test_bitwise(unittest.TestCase):