@@ -0,0 +1,418 @@
+%0Adef binary_search(array, low, high, item):%0A%0A    if(low%3Ehigh) :%0A        return -1%0A%0A    mid = (low + high)//2%0A%0A    if(item == array%5Bmid%5D):%0A        return mid%0A    elif item %3C array%5Bmid%5D:%0A        return binary_search(array, low, mid-1, item)%0A    elif item %3E array%5Bmid%5D:%0A        return binary_search(array, mid+1, high, item)%0A%0A%0Aprint ( binary_search(%5B1,4,5,7%5D, 0, 3, 5)) #2%0Aprint ( binary_search(%5B1,4,5,7%5D, 0, 3, 10)) #-1%0A

Add recursive binary search implementation