Binary Search

Author: Shikha-code36

README.md

@@ -18,4 +18,7 @@ Data Structures and Algorithms Patterns implemented in Python.
         - [x] [Reverse Linked List](Recursion/Linked-List/Reverse-Linked-List.py)
 - [x] [Graphs](Graphs)
     - [x] [Breadth First Search](Graphs/bfs.py)
-    - [x] [Depth First Search](Graphs/dfs.py)
+    - [x] [Depth First Search](Graphs/dfs.py)
+- [x] [Searching Alogorithms](Searching-Algo)
+    - [x] [Binary Search](Searching-Algo/binarysearch.py)
+    

Searching-Algo/binarysearch.py

@@ -0,0 +1,20 @@
+'''
+                                                             Binary Search
+ Binary Search is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half.
+'''
+
+def binarysearch(list,target):
+    left=0
+    right=len(list)-1
+    while left <= right:
+        mid = (left+right)//2
+        if target == list[mid]:
+            return mid
+        elif target> list[mid]:
+            left=mid+1
+        else:
+            right=mid-1
+            
+    return -1
+
+print(binarysearch([2,3,4,5],5)) #3