Binary Search using While Loop and recursion

Author: PTHARRISH

DSA/Binary_search.py

@@ -76,3 +76,38 @@ def binarysearch(arr,target):
 # Average Case: O(log N)
 # Worst Case: O(log N)
 # Auxiliary Space: O(1), If the recursive call stack is considered then the auxiliary space will be O(logN).
+
+
+# Binary Search using While Loop
+# def search(arr,l,r,v):
+#     while l<=r:
+#         mid=l+(r-1)//2
+#         if arr[mid]==v:
+#             return mid
+#         elif arr[mid]<r:
+#             l=mid+1
+#         else:
+#             r=mid-1
+#     return -1
+
+
+# Binary Search using Recursion
+# def search(arr,l,r,v):
+#     if l<=r:
+#         mid=l+(r-1)//2
+#         if arr[mid]==v:
+#             return mid
+#         elif arr[mid]>r:
+#             return search(arr,l,mid-1,v)
+#         else:
+#             return search(arr,mid+1,r,v)
+#     return -1
+
+
+
+# arr=[int(x)for x in input('array').split(",")]
+# v=int(input())
+# result=search(arr,0,len(arr),v)
+# print(result)
+
+