Merge pull request #1 from code-a-key/count_set_bits

count_set_bits

Author: jiisanda

Diff for: Bit Manipulation/3.3.1.count_set_bit_simple_method.py

@@ -6,13 +6,26 @@
 IP: n = 9 [1001]
 OP: 2
 
-TC:
-SC:
+TC: O(log n)
+SC: O(1)
 """
 def count_set_bits(num: int) -> int:
-    """Count set bits"""
+    """count set bits
 
+    Args:
+        num (int): input number
+
+    Returns:
+        int: number of set bits
+    """
+    count = 0
+    while num:
+        count += num & 1
+        num >>= 1
+    return count
+
+    # return bin(num).count('1')
 
 if __name__ == '__main__':
-    N = 9
-    count_set_bits(N)
+    N = 36
+    print(count_set_bits(N))

Diff for: Bit Manipulation/3.3.2.count_set_bit_brain_karningham_algo.py

@@ -1,18 +1,29 @@
 """
-COUNT SET BITS - Method 1: Naive Method
+COUNT SET BITS - Method 2: Brain Karnighan's Algorithm
 
 Count Number of 1's (set bits) in the binary representation of a given integer.
 
 IP: n = 9 [1001]
 OP: 2
 
-TC:
-SC:
+TC: O(logn)
+SC: O(1)
 """
 def count_set_bits(num: int) -> int:
-    """Count set bits"""
+    """count set bits
 
+    Args:
+        num (int): input number
+
+    Returns:
+        int: number of set bits
+    """
+    count = 0
+    while num:
+        num = num & (num - 1)
+        count += 1
+    return count
 
 if __name__ == '__main__':
-    N = 9
-    count_set_bits(N)
+    N = 36
+    print(count_set_bits(N))