Adding time complexity of the code

Author: ankit167

bit/count_ones.py

@@ -6,6 +6,8 @@
 For example, the 32-bit integer ’11' has binary
 representation 00000000000000000000000000001011,
 so the function should return 3.
+
+T(n)- O(log n)
 """