Merge pull request #753 from Monsieurvishal/master

Minor fix

Author: geekcomputers

Binary_search.py

@@ -3,7 +3,8 @@
 def binarySearch(arr, l, r, x):
     while l <= r:
 
-        mid = l + (r - l) / 2; #extracting the middle element from the array
+        mid = l + (r - l) / 2 #extracting the middle element from the array
+        mid=int(mid) #it has to be integer
 
         # Check if x is present at mid 
         if arr[mid] == x:

perfect_square.py

@@ -0,0 +1,11 @@
+# Simple and efficient python program to check whether a number is series of power of two 
+# Example:
+# Input:
+# 8
+# Output:
+# It comes in  power series of 2
+a = int(input("Enter a number"))
+if a & (a - 1) == 0:
+    print("It comes in  power series of 2")
+else:
+    print("It does not come in  power series of 2")